<!DOCTYPE html>
<html class="client-nojs vector-feature-night-mode-disabled vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-sticky-header-enabled" lang="en" dir="ltr"><head>
<meta charset="UTF-8">
<title>Bernoulli process</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link rel="canonical" href="https://en.wikipedia.org/wiki/Bernoulli_process"> <link href="./mw/ext.cite.styles.css" rel="stylesheet" type="text/css">
<link href="./mw/ext.math.styles.css" rel="stylesheet" type="text/css">
<link href="./mw/ext.pygments.css" rel="stylesheet" type="text/css">
<link href="./mw/skins.vector.icons.css" rel="stylesheet" type="text/css">
<link href="./mw/skins.vector.search.codex.styles.css" rel="stylesheet" type="text/css">
<link href="./mw/skins.vector.styles.css" rel="stylesheet" type="text/css">
<link href="./mw/user.styles.css" rel="stylesheet" type="text/css">
<meta name="ResourceLoaderDynamicStyles" content="">
<link rel="stylesheet" type="text/css" href="./mw/site.styles.css">
<link rel="stylesheet" type="text/css" href="./mw/noscript.css">
<link rel="stylesheet" type="text/css" href="./footer.css">
<link rel="stylesheet" type="text/css" href="./vector-2022.css">
</head>
<body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Bernoulli_process rootpage-Bernoulli_process skin-vector-2022 action-view">
<div class="mw-page-container">
<div class="mw-page-container-inner">
<div class="mw-content-container">
<main id="content" class="mw-body">
<header class="mw-body-header vector-page-titlebar">
<h1 id="firstHeading" class="firstHeading mw-first-heading">
<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Bernoulli process</span></span>
</h1>
</header>
<a id="top"></a>
<div id="bodyContent" class="vector-body ve-init-mw-desktopArticleTarget-targetContainer" aria-labelledby="firstHeading" data-mw-ve-target-container="">
<div id="mw-content-text" class="mw-body-content mw-content-ltr" lang="en" dir="ltr"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><p class="mw-empty-elt">
</p>
<style data-mw-deduplicate="TemplateStyles:r1305433154">
/* start https://en.wikipedia.org/ */
.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}
/* end https://en.wikipedia.org/ */
</style>
<style data-mw-deduplicate="TemplateStyles:r1129693374">
/* start https://en.wikipedia.org/ */
.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}
/* end https://en.wikipedia.org/ */
</style><style data-mw-deduplicate="TemplateStyles:r1246091330">
/* start https://en.wikipedia.org/ */
.mw-parser-output .sidebar{width:22em;float:right;clear:right;margin:0.5em 0 1em 1em;background:var(--background-color-neutral-subtle,#f8f9fa);border:1px solid var(--border-color-base,#a2a9b1);padding:0.2em;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse;display:table}body.skin-minerva .mw-parser-output .sidebar{display:table!important;float:right!important;margin:0.5em 0 1em 1em!important}.mw-parser-output .sidebar-subgroup{width:100%;margin:0;border-spacing:0}.mw-parser-output .sidebar-left{float:left;clear:left;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-none{float:none;clear:both;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-outer-title{padding:0 0.4em 0.2em;font-size:125%;line-height:1.2em;font-weight:bold}.mw-parser-output .sidebar-top-image{padding:0.4em}.mw-parser-output .sidebar-top-caption,.mw-parser-output .sidebar-pretitle-with-top-image,.mw-parser-output .sidebar-caption{padding:0.2em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-pretitle{padding:0.4em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-title,.mw-parser-output .sidebar-title-with-pretitle{padding:0.2em 0.8em;font-size:145%;line-height:1.2em}.mw-parser-output .sidebar-title-with-pretitle{padding:0.1em 0.4em}.mw-parser-output .sidebar-image{padding:0.2em 0.4em 0.4em}.mw-parser-output .sidebar-heading{padding:0.1em 0.4em}.mw-parser-output .sidebar-content{padding:0 0.5em 0.4em}.mw-parser-output .sidebar-content-with-subgroup{padding:0.1em 0.4em 0.2em}.mw-parser-output .sidebar-above,.mw-parser-output .sidebar-below{padding:0.3em 0.8em;font-weight:bold}.mw-parser-output .sidebar-collapse .sidebar-above,.mw-parser-output .sidebar-collapse .sidebar-below{border-top:1px solid #aaa;border-bottom:1px solid #aaa}.mw-parser-output .sidebar-navbar{text-align:right;font-size:115%;padding:0 0.4em 0.4em}.mw-parser-output .sidebar-list-title{padding:0 0.4em;text-align:left;font-weight:bold;line-height:1.6em;font-size:105%}.mw-parser-output .sidebar-list-title-c{padding:0 0.4em;text-align:center;margin:0 3.3em}@media(max-width:640px){body.mediawiki .mw-parser-output .sidebar{width:100%!important;clear:both;float:none!important;margin-left:0!important;margin-right:0!important}}body.skin--responsive .mw-parser-output .sidebar a>img{max-width:none!important}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media print{body.ns-0 .mw-parser-output .sidebar{display:none!important}}
/* end https://en.wikipedia.org/ */
</style><table class="sidebar nomobile nowraplinks hlist"><tbody><tr><td class="sidebar-pretitle">Part of a series on <a href="Statistics" title="Statistics">statistics</a></td></tr><tr><th class="sidebar-title-with-pretitle"><a href="Probability_theory" title="Probability theory">Probability theory</a></th></tr><tr><td class="sidebar-image"><span class="skin-invert" typeof="mw:File"></span></td></tr><tr><td class="sidebar-content">
<ul><li><a href="Probability" title="Probability">Probability</a>
<ul><li><a href="Probability_axioms" title="Probability axioms">Axioms</a></li></ul></li>
<li><a href="Determinism" title="Determinism">Determinism</a>
<ul><li><a href="Deterministic_system" title="Deterministic system">System</a></li></ul></li>
<li><a href="Indeterminism" title="Indeterminism">Indeterminism</a></li>
<li><a href="Randomness" title="Randomness">Randomness</a></li></ul></td>
</tr><tr><td class="sidebar-content">
<ul><li><a href="Probability_space" title="Probability space">Probability space</a></li>
<li><a href="Sample_space" title="Sample space">Sample space</a></li>
<li><a href="Event_(probability_theory)" title="Event (probability theory)">Event</a>
<ul><li><a href="Collectively_exhaustive_events" title="Collectively exhaustive events">Collectively exhaustive events</a></li>
<li><a href="Elementary_event" title="Elementary event">Elementary event</a></li>
<li><a href="Mutual_exclusivity" title="Mutual exclusivity">Mutual exclusivity</a></li>
<li><a href="Outcome_(probability)" title="Outcome (probability)">Outcome</a></li>
<li><a href="Singleton_(mathematics)" title="Singleton (mathematics)">Singleton</a></li></ul></li>
<li><a href="Experiment_(probability_theory)" title="Experiment (probability theory)">Experiment</a>
<ul><li><a href="Bernoulli_trial" title="Bernoulli trial">Bernoulli trial</a></li></ul></li>
<li><a href="Probability_distribution" title="Probability distribution">Probability distribution</a>
<ul><li><a href="Bernoulli_distribution" title="Bernoulli distribution">Bernoulli distribution</a></li>
<li><a href="Binomial_distribution" title="Binomial distribution">Binomial distribution</a></li>
<li><a href="Exponential_distribution" title="Exponential distribution">Exponential distribution</a></li>
<li><a href="Normal_distribution" title="Normal distribution">Normal distribution</a></li>
<li><a href="Pareto_distribution" title="Pareto distribution">Pareto distribution</a></li>
<li><a href="Poisson_distribution" title="Poisson distribution">Poisson distribution</a></li></ul></li>
<li><a href="Probability_measure" title="Probability measure">Probability measure</a></li>
<li><a href="Random_variable" title="Random variable">Random variable</a>
<ul>
<li><a href="Continuous_or_discrete_variable" title="Continuous or discrete variable">Continuous or discrete</a></li>
<li><a href="Expected_value" title="Expected value">Expected value</a></li>
<li><a href="Variance" title="Variance">Variance</a></li>
<li><a href="Markov_chain" title="Markov chain">Markov chain</a></li>
<li><a href="Realization_(probability)" title="Realization (probability)">Observed value</a></li>
<li><a href="Random_walk" title="Random walk">Random walk</a></li>
<li><a href="Stochastic_process" title="Stochastic process">Stochastic process</a></li></ul></li></ul></td>
</tr><tr><td class="sidebar-content">
<ul><li><a href="Complementary_event" title="Complementary event">Complementary event</a></li>
<li><a href="Joint_probability_distribution" title="Joint probability distribution">Joint probability</a></li>
<li><a href="Marginal_distribution" title="Marginal distribution">Marginal probability</a></li>
<li><a href="Conditional_probability" title="Conditional probability">Conditional probability</a></li></ul></td>
</tr><tr><td class="sidebar-content">
<ul><li><a href="Independence_(probability_theory)" title="Independence (probability theory)">Independence</a></li>
<li><a href="Conditional_independence" title="Conditional independence">Conditional independence</a></li>
<li><a href="Law_of_total_probability" title="Law of total probability">Law of total probability</a></li>
<li><a href="Law_of_large_numbers" title="Law of large numbers">Law of large numbers</a></li>
<li><a href="Bayes'_theorem" title="Bayes' theorem">Bayes' theorem</a></li>
<li><a href="Boole's_inequality" title="Boole's inequality">Boole's inequality</a></li></ul></td>
</tr><tr><td class="sidebar-content">
<ul><li><a href="Venn_diagram" title="Venn diagram">Venn diagram</a></li>
<li><a href="Tree_diagram_(probability_theory)" title="Tree diagram (probability theory)">Tree diagram</a></li></ul></td>
</tr><tr><td class="sidebar-navbar"><style data-mw-deduplicate="TemplateStyles:r1239400231">
/* start https://en.wikipedia.org/ */
.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}
/* end https://en.wikipedia.org/ */
</style></td></tr></tbody></table>
<p>In <a href="Probability" title="Probability">probability</a> and <a href="Statistics" title="Statistics">statistics</a>, a <b>Bernoulli process</b> (named after <a href="Jacob_Bernoulli" title="Jacob Bernoulli">Jacob Bernoulli</a>) is a finite or infinite sequence of binary <a href="Random_variable" title="Random variable">random variables</a>, so it is a <a href="Discrete-time_stochastic_process" class="mw-redirect" title="Discrete-time stochastic process">discrete-time stochastic process</a> that takes only two values, canonically 0 and 1. The component <b>Bernoulli variables</b> <i>X</i><sub><i>i</i></sub> are <a href="Independent_and_identically_distributed_random_variables" title="Independent and identically distributed random variables">identically distributed and independent</a>. Prosaically, a Bernoulli process is a repeated <a href="Coin_flipping" title="Coin flipping">coin flipping</a>, possibly with an unfair coin (but with consistent unfairness). Every variable <i>X</i><sub><i>i</i></sub> in the sequence is associated with a <a href="Bernoulli_trial" title="Bernoulli trial">Bernoulli trial</a> or experiment. They all have the same <a href="Bernoulli_distribution" title="Bernoulli distribution">Bernoulli distribution</a>. Much of what can be said about the Bernoulli process can also be generalized to more than two outcomes (such as the process for a six-sided die); this generalization is known as the <a href="Bernoulli_scheme" title="Bernoulli scheme">Bernoulli scheme</a>.
</p><p>The problem of determining the process, given only a limited sample of Bernoulli trials, may be called the problem of <a href="Checking_whether_a_coin_is_fair" title="Checking whether a coin is fair">checking whether a coin is fair</a>.
</p>
<meta property="mw:PageProp/toc">
<div class="mw-heading mw-heading2"><h2 id="Definition">Definition</h2></div>
<p>A <i>Bernoulli process</i> is a finite or infinite sequence of <a href="Statistical_independence" class="mw-redirect" title="Statistical independence">independent</a> <a href="Random_variable" title="Random variable">random variables</a> <i>X</i><sub>1</sub>, <i>X</i><sub>2</sub>, <i>X</i><sub>3</sub>, ..., such that
</p>
<ul><li>for each <i>i</i>, the value of <i>X</i><sub><i>i</i></sub> is either 0 or 1;</li>
<li>for all values of <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\textstyle i}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="false" scriptlevel="0">
<mi>i</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\textstyle i}</annotation>
</semantics>
</math></span><img src="./5b0f327332497b21a059c479e7b2ce098baa1a7e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:0.802ex; height:2.176ex;" alt="{\textstyle i}" loading="lazy"></span>, the probability <i>p</i> that <i>X</i><sub><i>i</i></sub> = 1 is the same.</li></ul>
<p>In other words, a Bernoulli process is a sequence of <a href="Independent_identically_distributed" class="mw-redirect" title="Independent identically distributed">independent identically distributed</a> <a href="Bernoulli_trial" title="Bernoulli trial">Bernoulli trials</a>.
</p><p>Independence of the trials implies that the process is <a href="Memorylessness" title="Memorylessness">memoryless</a>, in which past event frequencies have no influence on about future event probability frequencies. In most instances the true value of <i>p</i> is unknown, therefore we use past frequencies to assess/forecast/estimate future events & their probabilities indirectly via applying probabilistic inference upon <i>p</i>.
</p><p>If the process is infinite, then from any point the future trials constitute a Bernoulli process identical to the whole process, the fresh-start property.
</p>
<div class="mw-heading mw-heading3"><h3 id="Interpretation">Interpretation</h3></div>
<p>The two possible values of each <i>X</i><sub><i>i</i></sub> are often called "success" and "failure". Thus, when expressed as a number 0 or 1, the outcome may be called the number of successes on the <i>i</i>th "trial".
</p><p>Two other common interpretations of the values are true or false and yes or no. Under any interpretation of the two values, the individual variables <i>X</i><sub><i>i</i></sub> may be called <a href="Bernoulli_trial" title="Bernoulli trial">Bernoulli trials</a> with parameter p.
</p><p>In many applications time passes between trials, as the index i increases. In effect, the trials <i>X</i><sub>1</sub>, <i>X</i><sub>2</sub>, ... <i>X</i><sub>i</sub>, ... happen at "points in time" 1, 2, ..., <i>i</i>, .... That passage of time and the associated notions of "past" and "future" are not necessary, however. Most generally, any <i>X</i><sub>i</sub> and <i>X</i><sub><i>j</i></sub> in the process are simply two from a set of random variables indexed by {1, 2, ..., <i>n</i>}, the finite cases, or by {1, 2, 3, ...}, the infinite cases.
</p><p>One experiment with only two possible outcomes, often referred to as "success" and "failure", usually encoded as 1 and 0, can be modeled as a <a href="Bernoulli_distribution" title="Bernoulli distribution">Bernoulli distribution</a>.<sup id="cite_ref-:0_1-0" class="reference"><a href="#cite_note-:0-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> Several random variables and <a href="Probability_distribution" title="Probability distribution">probability distributions</a> beside the Bernoullis may be derived from the Bernoulli process:
</p>
<ul><li>The number of successes in the first <i>n</i> trials, which has a <a href="Binomial_distribution" title="Binomial distribution">binomial distribution</a> B(<i>n</i>, <i>p</i>)</li>
<li>The number of failures needed to get <i>r</i> successes, which has a <a href="Negative_binomial_distribution" title="Negative binomial distribution">negative binomial distribution</a> NB(<i>r</i>, <i>p</i>)</li>
<li>The number of failures needed to get one success, which has a <a href="Geometric_distribution" title="Geometric distribution">geometric distribution</a> NB(1, <i>p</i>), a special case of the negative binomial distribution</li></ul>
<p>The negative binomial variables may be interpreted as random <a href="Negative_binomial_distribution#Waiting_time_in_a_Bernoulli_process" title="Negative binomial distribution">waiting times</a>.
</p>
<div class="mw-heading mw-heading2"><h2 id="Formal_definition">Formal definition</h2></div>
<p>The Bernoulli process can be formalized in the language of <a href="Probability_space" title="Probability space">probability spaces</a> as a random sequence of independent realisations of a random variable that can take values of heads or tails. The state space for an individual value is denoted by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2=\{H,T\}.}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>2</mn>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>H</mi>
<mo>,</mo>
<mi>T</mi>
<mo fence="false" stretchy="false">}</mo>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 2=\{H,T\}.}</annotation>
</semantics>
</math></span><img src="./4df002e5664db25acc189ca0365ea865aa53c37c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:11.966ex; height:2.843ex;" alt="{\displaystyle 2=\{H,T\}.}" loading="lazy"></span>
</p>
<div class="mw-heading mw-heading3"><h3 id="Borel_algebra">Borel algebra</h3></div>
<p>Consider the <a href="Countably_infinite" class="mw-redirect" title="Countably infinite">countably infinite</a> <a href="Direct_product" title="Direct product">direct product</a> of copies of <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2=\{H,T\}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>2</mn>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>H</mi>
<mo>,</mo>
<mi>T</mi>
<mo fence="false" stretchy="false">}</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 2=\{H,T\}}</annotation>
</semantics>
</math></span><img src="./eb01e237ed6373ad4ca4d6b957efe2dab641d439.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:11.32ex; height:2.843ex;" alt="{\displaystyle 2=\{H,T\}}" loading="lazy"></span>. It is common to examine either the one-sided set <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \Omega =2^{\mathbb {N} }=\{H,T\}^{\mathbb {N} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mrow>
</msup>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>H</mi>
<mo>,</mo>
<mi>T</mi>
<msup>
<mo fence="false" stretchy="false">}</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \Omega =2^{\mathbb {N} }=\{H,T\}^{\mathbb {N} }}</annotation>
</semantics>
</math></span><img src="./1a59f7363346474660f1db79fbdf47596cc89cad.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:18.934ex; height:3.176ex;" alt="{\displaystyle \Omega =2^{\mathbb {N} }=\{H,T\}^{\mathbb {N} }}" loading="lazy"></span> or the two-sided set <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \Omega =2^{\mathbb {Z} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \Omega =2^{\mathbb {Z} }}</annotation>
</semantics>
</math></span><img src="./406bc8ee0ccc3e62b046d4debc7450c8a4d2178a.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.267ex; height:2.676ex;" alt="{\displaystyle \Omega =2^{\mathbb {Z} }}" loading="lazy"></span>. There is a natural <a href="Topology" title="Topology">topology</a> on this space, called the <a href="Product_topology" title="Product topology">product topology</a>. The sets in this topology are finite sequences of coin flips, that is, finite-length <a href="String_(computer_science)" title="String (computer science)">strings</a> of <i>H</i> and <i>T</i> (<i>H</i> stands for heads and <i>T</i> stands for tails), with the rest of (infinitely long) sequence taken as "don't care". These sets of finite sequences are referred to as <a href="Cylinder_set" title="Cylinder set">cylinder sets</a> in the product topology. The set of all such strings forms a <a href="Sigma_algebra" class="mw-redirect" title="Sigma algebra">sigma algebra</a>, specifically, a <a href="Borel_algebra" class="mw-redirect" title="Borel algebra">Borel algebra</a>. This algebra is then commonly written as <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle (\Omega ,{\mathcal {B}})}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mo stretchy="false">(</mo>
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>,</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle (\Omega ,{\mathcal {B}})}</annotation>
</semantics>
</math></span><img src="./d3c71c3b681b11d672fb4712a121dc140ff810ef.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:6.065ex; height:2.843ex;" alt="{\displaystyle (\Omega ,{\mathcal {B}})}" loading="lazy"></span> where the elements of <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {B}}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {B}}}</annotation>
</semantics>
</math></span><img src="./e5622de88a69f68340f8dcb43d0b8bd443ba9e13.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.543ex; height:2.176ex;" alt="{\displaystyle {\mathcal {B}}}" loading="lazy"></span> are the finite-length sequences of coin flips (the cylinder sets).
</p>
<div class="mw-heading mw-heading3"><h3 id="Bernoulli_measure">Bernoulli measure</h3></div>
<p>If the chances of flipping heads or tails are given by the probabilities <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \{p,1-p\}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mo fence="false" stretchy="false">{</mo>
<mi>p</mi>
<mo>,</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<mo fence="false" stretchy="false">}</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \{p,1-p\}}</annotation>
</semantics>
</math></span><img src="./6d01c91615e0b92e850258845454138c23cefab7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:9.701ex; height:2.843ex;" alt="{\displaystyle \{p,1-p\}}" loading="lazy"></span>, then one can define a natural <a href="Measure_(mathematics)" title="Measure (mathematics)">measure</a> on the product space, given by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P=\{p,1-p\}^{\mathbb {N} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>p</mi>
<mo>,</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msup>
<mo fence="false" stretchy="false">}</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P=\{p,1-p\}^{\mathbb {N} }}</annotation>
</semantics>
</math></span><img src="./867759cb264b7882752917ee5cdfae69cfbbf116.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:15.963ex; height:3.176ex;" alt="{\displaystyle P=\{p,1-p\}^{\mathbb {N} }}" loading="lazy"></span> (or by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P=\{p,1-p\}^{\mathbb {Z} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>p</mi>
<mo>,</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msup>
<mo fence="false" stretchy="false">}</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P=\{p,1-p\}^{\mathbb {Z} }}</annotation>
</semantics>
</math></span><img src="./e9c3a2c741c414a20bc873b90a660d2f053aad18.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:15.873ex; height:3.176ex;" alt="{\displaystyle P=\{p,1-p\}^{\mathbb {Z} }}" loading="lazy"></span> for the two-sided process). In another word, if a <a href="Discrete_random_variable" class="mw-redirect" title="Discrete random variable">discrete random variable</a> <i>X</i> has a <i>Bernoulli distribution</i> with parameter <i>p</i>, where 0 ≤ <i>p</i> ≤ 1, and its <a href="Probability_mass_function" title="Probability mass function">probability mass function</a> is given by
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle pX(1)=P(X=1)=p}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>p</mi>
<mi>X</mi>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>P</mi>
<mo stretchy="false">(</mo>
<mi>X</mi>
<mo>=</mo>
<mn>1</mn>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>p</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle pX(1)=P(X=1)=p}</annotation>
</semantics>
</math></span><img src="./b67147d9577acbf513c6392630f5ea3e8a597fb6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; margin-left: -0.089ex; width:23.373ex; height:2.843ex;" alt="{\displaystyle pX(1)=P(X=1)=p}" loading="lazy"></span> and <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle pX(0)=P(X=0)=1-p}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>p</mi>
<mi>X</mi>
<mo stretchy="false">(</mo>
<mn>0</mn>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>P</mi>
<mo stretchy="false">(</mo>
<mi>X</mi>
<mo>=</mo>
<mn>0</mn>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle pX(0)=P(X=0)=1-p}</annotation>
</semantics>
</math></span><img src="./253dd31789a0f50721670b4091fa73941aa53ba0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; margin-left: -0.089ex; width:27.375ex; height:2.843ex;" alt="{\displaystyle pX(0)=P(X=0)=1-p}" loading="lazy"></span>.</dd></dl>
<p>We denote this distribution by Ber(<i>p</i>).<sup id="cite_ref-:0_1-1" class="reference"><a href="#cite_note-:0-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup>
</p><p>Given a cylinder set, that is, a specific sequence of coin flip results <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle [\omega _{1},\omega _{2},\cdots \omega _{n}]}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mo stretchy="false">[</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo stretchy="false">]</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle [\omega _{1},\omega _{2},\cdots \omega _{n}]}</annotation>
</semantics>
</math></span><img src="./ed3b3323ee7dbc47be143f487b9885af758ef837.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:14.136ex; height:2.843ex;" alt="{\displaystyle [\omega _{1},\omega _{2},\cdots \omega _{n}]}" loading="lazy"></span> at times <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 1,2,\cdots ,n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo>,</mo>
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 1,2,\cdots ,n}</annotation>
</semantics>
</math></span><img src="./084268c7751cf630173a19eb80a24873f4eb9c9c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:9.932ex; height:2.509ex;" alt="{\displaystyle 1,2,\cdots ,n}" loading="lazy"></span>, the probability of observing this particular sequence is given by
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P([\omega _{1},\omega _{2},\cdots ,\omega _{n}])=p^{k}(1-p)^{n-k}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo stretchy="false">(</mo>
<mo stretchy="false">[</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo>,</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo stretchy="false">]</mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<msup>
<mi>p</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
</mrow>
</msup>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msup>
<mo stretchy="false">)</mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>−<!-- − --></mo>
<mi>k</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P([\omega _{1},\omega _{2},\cdots ,\omega _{n}])=p^{k}(1-p)^{n-k}}</annotation>
</semantics>
</math></span><img src="./b1eed2fcad96057c5a9acf5c2f4202ec8ede38a5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:34.417ex; height:3.176ex;" alt="{\displaystyle P([\omega _{1},\omega _{2},\cdots ,\omega _{n}])=p^{k}(1-p)^{n-k}}" loading="lazy"></span></dd></dl>
<p>where <i>k</i> is the number of times that <i>H</i> appears in the sequence, and <i>n</i>−<i>k</i> is the number of times that <i>T</i> appears in the sequence. There are several different kinds of notations for the above; a common one is to write
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P(X_{1}=x_{1},X_{2}=x_{2},\cdots ,X_{n}=x_{n})=p^{k}(1-p)^{n-k}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo stretchy="false">(</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mi>x</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mi>x</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mi>x</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo stretchy="false">)</mo>
<mo>=</mo>
<msup>
<mi>p</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
</mrow>
</msup>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msup>
<mo stretchy="false">)</mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>−<!-- − --></mo>
<mi>k</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P(X_{1}=x_{1},X_{2}=x_{2},\cdots ,X_{n}=x_{n})=p^{k}(1-p)^{n-k}}</annotation>
</semantics>
</math></span><img src="./415e36f5220320893890d45f54e1ee7a949023f5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:51.17ex; height:3.176ex;" alt="{\displaystyle P(X_{1}=x_{1},X_{2}=x_{2},\cdots ,X_{n}=x_{n})=p^{k}(1-p)^{n-k}}" loading="lazy"></span></dd></dl>
<p>where each <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle X_{i}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle X_{i}}</annotation>
</semantics>
</math></span><img src="./af4a0955af42beb5f85aa05fb8c07abedc13990d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.724ex; height:2.509ex;" alt="{\displaystyle X_{i}}" loading="lazy"></span> is a binary-valued <a href="Random_variable" title="Random variable">random variable</a> with <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle x_{i}=[\omega _{i}=H]}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>x</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo>=</mo>
<mo stretchy="false">[</mo>
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>H</mi>
<mo stretchy="false">]</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle x_{i}=[\omega _{i}=H]}</annotation>
</semantics>
</math></span><img src="./1b1deb4ea3e089b3605c4f8ddefc18e0505463e6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:13.929ex; height:2.843ex;" alt="{\displaystyle x_{i}=[\omega _{i}=H]}" loading="lazy"></span> in <a href="Iverson_bracket" title="Iverson bracket">Iverson bracket</a> notation, meaning either <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 1}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>1</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 1}</annotation>
</semantics>
</math></span><img src="./92d98b82a3778f043108d4e20960a9193df57cbf.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.162ex; height:2.176ex;" alt="{\displaystyle 1}" loading="lazy"></span> if <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \omega _{i}=H}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>H</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \omega _{i}=H}</annotation>
</semantics>
</math></span><img src="./0a7fac946a752ac5fe3ac7a6bc9f25dc3c3aca64.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:7.408ex; height:2.509ex;" alt="{\displaystyle \omega _{i}=H}" loading="lazy"></span> or <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 0}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>0</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 0}</annotation>
</semantics>
</math></span><img src="./2aae8864a3c1fec9585261791a809ddec1489950.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.162ex; height:2.176ex;" alt="{\displaystyle 0}" loading="lazy"></span> if <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \omega _{i}=T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>ω<!-- ω --></mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \omega _{i}=T}</annotation>
</semantics>
</math></span><img src="./30646d89f80c407d09a4d67dc165271de5caabf7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:6.98ex; height:2.509ex;" alt="{\displaystyle \omega _{i}=T}" loading="lazy"></span>. This probability <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P}</annotation>
</semantics>
</math></span><img src="./b4dc73bf40314945ff376bd363916a738548d40a.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.745ex; height:2.176ex;" alt="{\displaystyle P}" loading="lazy"></span> is commonly called the <a href="Bernoulli_measure" class="mw-redirect" title="Bernoulli measure">Bernoulli measure</a>.<sup id="cite_ref-klenke_2-0" class="reference"><a href="#cite_note-klenke-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup>
</p><p>Note that the probability of any specific, infinitely long sequence of coin flips is exactly zero; this is because <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \lim _{n\to \infty }p^{n}=0}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<munder>
<mo movablelimits="true" form="prefix">lim</mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo stretchy="false">→<!-- → --></mo>
<mi mathvariant="normal">∞<!-- ∞ --></mi>
</mrow>
</munder>
<msup>
<mi>p</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msup>
<mo>=</mo>
<mn>0</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \lim _{n\to \infty }p^{n}=0}</annotation>
</semantics>
</math></span><img src="./e530227135fedcf2928fdf392b4dbd1318243b73.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.838ex; width:11.308ex; height:3.843ex;" alt="{\displaystyle \lim _{n\to \infty }p^{n}=0}" loading="lazy"></span>, for any <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 0\leq p<1}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>0</mn>
<mo>≤<!-- ≤ --></mo>
<mi>p</mi>
<mo><</mo>
<mn>1</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 0\leq p<1}</annotation>
</semantics>
</math></span><img src="./ddd9ada1b1951e8892f14b77b1398bda4ee4451e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:9.691ex; height:2.509ex;" alt="{\displaystyle 0\leq p<1}" loading="lazy"></span>. A probability equal to 1 implies that any given infinite sequence has <a href="Measure_zero" class="mw-redirect" title="Measure zero">measure zero</a>. Nevertheless, one can still say that some classes of infinite sequences of coin flips are far more likely than others, this is given by the <a href="Asymptotic_equipartition_property" title="Asymptotic equipartition property">asymptotic equipartition property</a>.
</p><p>To conclude the formal definition, a Bernoulli process is then given by the probability triple <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle (\Omega ,{\mathcal {B}},P)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mo stretchy="false">(</mo>
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>,</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo>,</mo>
<mi>P</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle (\Omega ,{\mathcal {B}},P)}</annotation>
</semantics>
</math></span><img src="./5d8cee167d91b7b7ac82f576d5dda69133ceb179.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:8.844ex; height:2.843ex;" alt="{\displaystyle (\Omega ,{\mathcal {B}},P)}" loading="lazy"></span>, as defined above.
</p>
<div class="mw-heading mw-heading2"><h2 id="Law_of_large_numbers,_binomial_distribution_and_central_limit_theorem">Law of large numbers, binomial distribution and central limit theorem</h2></div>
<style data-mw-deduplicate="TemplateStyles:r1236090951">
/* start https://en.wikipedia.org/ */
.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}
/* end https://en.wikipedia.org/ */
</style><div role="note" class="hatnote navigation-not-searchable">Main articles: <a href="Law_of_large_numbers" title="Law of large numbers">Law of large numbers</a>, <a href="Central_limit_theorem" title="Central limit theorem">Central limit theorem</a>, and <a href="Binomial_distribution" title="Binomial distribution">Binomial distribution</a></div>
<p>Let us assume the canonical process with <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle H}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>H</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle H}</annotation>
</semantics>
</math></span><img src="./75a9edddcca2f782014371f75dca39d7e13a9c1b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.064ex; height:2.176ex;" alt="{\displaystyle H}" loading="lazy"></span> represented by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 1}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>1</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 1}</annotation>
</semantics>
</math></span><img src="./92d98b82a3778f043108d4e20960a9193df57cbf.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.162ex; height:2.176ex;" alt="{\displaystyle 1}" loading="lazy"></span> and <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span> represented by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 0}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>0</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 0}</annotation>
</semantics>
</math></span><img src="./2aae8864a3c1fec9585261791a809ddec1489950.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.162ex; height:2.176ex;" alt="{\displaystyle 0}" loading="lazy"></span>. The <a href="Law_of_large_numbers" title="Law of large numbers">law of large numbers</a> states that the average of the sequence, i.e., <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\bar {X}}_{n}:={\frac {1}{n}}\sum _{i=1}^{n}X_{i}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mover>
<mi>X</mi>
<mo stretchy="false">¯<!-- ¯ --></mo>
</mover>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo>:=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mi>n</mi>
</mfrac>
</mrow>
<munderover>
<mo>∑<!-- ∑ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</munderover>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\bar {X}}_{n}:={\frac {1}{n}}\sum _{i=1}^{n}X_{i}}</annotation>
</semantics>
</math></span><img src="./c9a2ff703b59baec9a9110d387d9c1aa804f2e68.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.005ex; width:16.028ex; height:6.843ex;" alt="{\displaystyle {\bar {X}}_{n}:={\frac {1}{n}}\sum _{i=1}^{n}X_{i}}" loading="lazy"></span>, will approach the <a href="Expected_value" title="Expected value">expected value</a> almost certainly, that is, the events which do not satisfy this limit have zero probability. The <a href="Expectation_value" class="mw-redirect" title="Expectation value">expectation value</a> of flipping <i>heads</i>, assumed to be represented by 1, is given by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle p}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>p</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle p}</annotation>
</semantics>
</math></span><img src="./81eac1e205430d1f40810df36a0edffdc367af36.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; margin-left: -0.089ex; width:1.259ex; height:2.009ex;" alt="{\displaystyle p}" loading="lazy"></span>. In fact, one has
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {E} [X_{i}]=\mathbb {P} ([X_{i}=1])=p,}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">E</mi>
</mrow>
<mo stretchy="false">[</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo stretchy="false">]</mo>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">P</mi>
</mrow>
<mo stretchy="false">(</mo>
<mo stretchy="false">[</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mo>=</mo>
<mn>1</mn>
<mo stretchy="false">]</mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>p</mi>
<mo>,</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {E} [X_{i}]=\mathbb {P} ([X_{i}=1])=p,}</annotation>
</semantics>
</math></span><img src="./f32d3d5005d32d9b10eeea3256b89223da049917.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:25.089ex; height:2.843ex;" alt="{\displaystyle \mathbb {E} [X_{i}]=\mathbb {P} ([X_{i}=1])=p,}" loading="lazy"></span></dd></dl>
<p>for any given random variable <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle X_{i}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle X_{i}}</annotation>
</semantics>
</math></span><img src="./af4a0955af42beb5f85aa05fb8c07abedc13990d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.724ex; height:2.509ex;" alt="{\displaystyle X_{i}}" loading="lazy"></span> out of the infinite sequence of <a href="Bernoulli_trial" title="Bernoulli trial">Bernoulli trials</a> that compose the Bernoulli process.
</p><p>One is often interested in knowing how often one will observe <i>H</i> in a sequence of <i>n</i> coin flips. This is given by simply counting: Given <i>n</i> successive coin flips, that is, given the set of all possible <a href="String_(computer_science)" title="String (computer science)">strings</a> of length <i>n</i>, the number <i>N</i>(<i>k</i>,<i>n</i>) of such strings that contain <i>k</i> occurrences of <i>H</i> is given by the <a href="Binomial_coefficient" title="Binomial coefficient">binomial coefficient</a>
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle N(k,n)={n \choose k}={\frac {n!}{k!(n-k)!}}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>N</mi>
<mo stretchy="false">(</mo>
<mi>k</mi>
<mo>,</mo>
<mi>n</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow>
<mrow class="MJX-TeXAtom-OPEN">
<mo maxsize="2.047em" minsize="2.047em">(</mo>
</mrow>
<mfrac linethickness="0">
<mi>n</mi>
<mi>k</mi>
</mfrac>
<mrow class="MJX-TeXAtom-CLOSE">
<mo maxsize="2.047em" minsize="2.047em">)</mo>
</mrow>
</mrow>
</mrow>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mrow>
<mi>n</mi>
<mo>!</mo>
</mrow>
<mrow>
<mi>k</mi>
<mo>!</mo>
<mo stretchy="false">(</mo>
<mi>n</mi>
<mo>−<!-- − --></mo>
<mi>k</mi>
<mo stretchy="false">)</mo>
<mo>!</mo>
</mrow>
</mfrac>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle N(k,n)={n \choose k}={\frac {n!}{k!(n-k)!}}}</annotation>
</semantics>
</math></span><img src="./d4c334acb6d9da6da63e2f395231e64dabd730cb.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.671ex; width:29.122ex; height:6.343ex;" alt="{\displaystyle N(k,n)={n \choose k}={\frac {n!}{k!(n-k)!}}}" loading="lazy"></span></dd></dl>
<p>If the probability of flipping heads is given by <i>p</i>, then the total probability of seeing a string of length <i>n</i> with <i>k</i> heads is
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {P} ([S_{n}=k])={n \choose k}p^{k}(1-p)^{n-k},}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">P</mi>
</mrow>
<mo stretchy="false">(</mo>
<mo stretchy="false">[</mo>
<msub>
<mi>S</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>k</mi>
<mo stretchy="false">]</mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow>
<mrow class="MJX-TeXAtom-OPEN">
<mo maxsize="2.047em" minsize="2.047em">(</mo>
</mrow>
<mfrac linethickness="0">
<mi>n</mi>
<mi>k</mi>
</mfrac>
<mrow class="MJX-TeXAtom-CLOSE">
<mo maxsize="2.047em" minsize="2.047em">)</mo>
</mrow>
</mrow>
</mrow>
<msup>
<mi>p</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
</mrow>
</msup>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msup>
<mo stretchy="false">)</mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>−<!-- − --></mo>
<mi>k</mi>
</mrow>
</msup>
<mo>,</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {P} ([S_{n}=k])={n \choose k}p^{k}(1-p)^{n-k},}</annotation>
</semantics>
</math></span><img src="./a38b43a701bd6686f2200c2ce1f6931164a8e4f3.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:32.631ex; height:6.176ex;" alt="{\displaystyle \mathbb {P} ([S_{n}=k])={n \choose k}p^{k}(1-p)^{n-k},}" loading="lazy"></span></dd></dl>
<p>where <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S_{n}=\sum _{i=1}^{n}X_{i}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>S</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<munderover>
<mo>∑<!-- ∑ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</munderover>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle S_{n}=\sum _{i=1}^{n}X_{i}}</annotation>
</semantics>
</math></span><img src="./e0b0d69cc8df818524313037654d98257f9bd148.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.005ex; width:12.208ex; height:6.843ex;" alt="{\displaystyle S_{n}=\sum _{i=1}^{n}X_{i}}" loading="lazy"></span>.
The probability measure thus defined is known as the <a href="Binomial_distribution" title="Binomial distribution">Binomial distribution</a>.
</p><p>As we can see from the above formula that, if n=1, the <i>Binomial distribution</i> will turn into a <i>Bernoulli distribution</i>. So we can know that the <i>Bernoulli distribution</i> is exactly a special case of <i>Binomial distribution</i> when n equals to 1.
</p><p>Of particular interest is the question of the value of <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S_{n}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>S</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle S_{n}}</annotation>
</semantics>
</math></span><img src="./9f049ac28d4ac8097b625f9d71c1f22b2ebd1bc4.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.643ex; height:2.509ex;" alt="{\displaystyle S_{n}}" loading="lazy"></span> for a sufficiently long sequences of coin flips, that is, for the limit <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n\to \infty }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
<mo stretchy="false">→<!-- → --></mo>
<mi mathvariant="normal">∞<!-- ∞ --></mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n\to \infty }</annotation>
</semantics>
</math></span><img src="./a0d55d9b32f6fa8fab6a84ea444a6b5a24bb45e1.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.333ex; height:1.843ex;" alt="{\displaystyle n\to \infty }" loading="lazy"></span>. In this case, one may make use of <a href="Stirling's_approximation" title="Stirling's approximation">Stirling's approximation</a> to the factorial, and write
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n!={\sqrt {2\pi n}}\;n^{n}e^{-n}\left(1+{\mathcal {O}}\left({\frac {1}{n}}\right)\right)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
<mo>!</mo>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<msqrt>
<mn>2</mn>
<mi>π<!-- π --></mi>
<mi>n</mi>
</msqrt>
</mrow>
<mspace width="thickmathspace"></mspace>
<msup>
<mi>n</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msup>
<msup>
<mi>e</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mi>n</mi>
</mrow>
</msup>
<mrow>
<mo>(</mo>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">O</mi>
</mrow>
</mrow>
<mrow>
<mo>(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mi>n</mi>
</mfrac>
</mrow>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n!={\sqrt {2\pi n}}\;n^{n}e^{-n}\left(1+{\mathcal {O}}\left({\frac {1}{n}}\right)\right)}</annotation>
</semantics>
</math></span><img src="./319dd7a95be32755ba1019f770136ae2b93024cd.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:33.504ex; height:6.176ex;" alt="{\displaystyle n!={\sqrt {2\pi n}}\;n^{n}e^{-n}\left(1+{\mathcal {O}}\left({\frac {1}{n}}\right)\right)}" loading="lazy"></span></dd></dl>
<p>Inserting this into the expression for <i>P</i>(<i>k</i>,<i>n</i>), one obtains the <a href="Normal_distribution" title="Normal distribution">Normal distribution</a>; this is the content of the <a href="Central_limit_theorem" title="Central limit theorem">central limit theorem</a>, and this is the simplest example thereof.
</p><p>The combination of the law of large numbers, together with the central limit theorem, leads to an interesting and perhaps surprising result: the <a href="Asymptotic_equipartition_property" title="Asymptotic equipartition property">asymptotic equipartition property</a>. Put informally, one notes that, yes, over many coin flips, one will observe <i>H</i> exactly <i>p</i> fraction of the time, and that this corresponds exactly with the peak of the Gaussian. The asymptotic equipartition property essentially states that this peak is infinitely sharp, with infinite fall-off on either side. That is, given the set of all possible infinitely long strings of <i>H</i> and <i>T</i> occurring in the Bernoulli process, this set is partitioned into two: those strings that occur with probability 1, and those that occur with probability 0. This partitioning is known as the <a href="Kolmogorov_0-1_law" class="mw-redirect" title="Kolmogorov 0-1 law">Kolmogorov 0-1 law</a>.
</p><p>The size of this set is interesting, also, and can be explicitly determined: the logarithm of it is exactly the <a href="Information_entropy" class="mw-redirect" title="Information entropy">entropy</a> of the Bernoulli process. Once again, consider the set of all strings of length <i>n</i>. The size of this set is <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 2^{n}}</annotation>
</semantics>
</math></span><img src="./8226f30650ee4fe4e640c6d2798127e80e9c160d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.381ex; height:2.343ex;" alt="{\displaystyle 2^{n}}" loading="lazy"></span>. Of these, only a certain subset are likely; the size of this set is <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{nH}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mi>H</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 2^{nH}}</annotation>
</semantics>
</math></span><img src="./97e2b50766e9f8e2fda464bba6ac83397c87e644.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:3.84ex; height:2.676ex;" alt="{\displaystyle 2^{nH}}" loading="lazy"></span> for <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle H\leq 1}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>H</mi>
<mo>≤<!-- ≤ --></mo>
<mn>1</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle H\leq 1}</annotation>
</semantics>
</math></span><img src="./10d57055d347a10f82f0483a89c3324c2befcc50.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.505ex; width:6.325ex; height:2.343ex;" alt="{\displaystyle H\leq 1}" loading="lazy"></span>. By using Stirling's approximation, putting it into the expression for <i>P</i>(<i>k</i>,<i>n</i>), solving for the location and width of the peak, and finally taking <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n\to \infty }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
<mo stretchy="false">→<!-- → --></mo>
<mi mathvariant="normal">∞<!-- ∞ --></mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n\to \infty }</annotation>
</semantics>
</math></span><img src="./a0d55d9b32f6fa8fab6a84ea444a6b5a24bb45e1.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.333ex; height:1.843ex;" alt="{\displaystyle n\to \infty }" loading="lazy"></span> one finds that
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle H=-p\log _{2}p-(1-p)\log _{2}(1-p)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>H</mi>
<mo>=</mo>
<mo>−<!-- − --></mo>
<mi>p</mi>
<msub>
<mi>log</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo><!-- --></mo>
<mi>p</mi>
<mo>−<!-- − --></mo>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<mo stretchy="false">)</mo>
<msub>
<mi>log</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo><!-- --></mo>
<mo stretchy="false">(</mo>
<mn>1</mn>
<mo>−<!-- − --></mo>
<mi>p</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle H=-p\log _{2}p-(1-p)\log _{2}(1-p)}</annotation>
</semantics>
</math></span><img src="./4e27c20e74b5fdc4f0fd906e1d183254623dd48c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:35.326ex; height:2.843ex;" alt="{\displaystyle H=-p\log _{2}p-(1-p)\log _{2}(1-p)}" loading="lazy"></span></dd></dl>
<p>This value is the <a href="Bernoulli_entropy" class="mw-redirect" title="Bernoulli entropy">Bernoulli entropy</a> of a Bernoulli process. Here, <i>H</i> stands for entropy; not to be confused with the same symbol <i>H</i> standing for <i>heads</i>.
</p><p><a href="John_von_Neumann" title="John von Neumann">John von Neumann</a> posed a question about the Bernoulli process regarding the possibility of a given process being <a href="Isomorphic" class="mw-redirect" title="Isomorphic">isomorphic</a> to another, in the sense of the <a href="Isomorphism_of_dynamical_systems" class="mw-redirect" title="Isomorphism of dynamical systems">isomorphism of dynamical systems</a>. The question long defied analysis, but was finally and completely answered with the <a href="Ornstein_isomorphism_theorem" title="Ornstein isomorphism theorem">Ornstein isomorphism theorem</a>. This breakthrough resulted in the understanding that the Bernoulli process is unique and <a href="Universal_property" title="Universal property">universal</a>; in a certain sense, it is the single most random process possible; nothing is 'more' random than the Bernoulli process (although one must be careful with this informal statement; certainly, systems that are <a href="Mixing_(mathematics)" title="Mixing (mathematics)">mixing</a> are, in a certain sense, "stronger" than the Bernoulli process, which is merely ergodic but not mixing. However, such processes do not consist of independent random variables: indeed, many purely deterministic, non-random systems can be mixing).
</p>
<div class="mw-heading mw-heading2"><h2 id="Dynamical_systems">Dynamical systems</h2></div>
<p>The Bernoulli process can also be understood to be a <a href="Dynamical_system" title="Dynamical system">dynamical system</a>, as an example of an <a href="Ergodic_system" class="mw-redirect" title="Ergodic system">ergodic system</a> and specifically, a <a href="Measure-preserving_dynamical_system" title="Measure-preserving dynamical system">measure-preserving dynamical system</a>, in one of several different ways. One way is as a <a href="Shift_space" title="Shift space">shift space</a>, and the other is as an <a href="Markov_odometer" title="Markov odometer">odometer</a>. These are reviewed below.
</p>
<div class="mw-heading mw-heading3"><h3 id="Bernoulli_shift">Bernoulli shift</h3></div>
<div role="note" class="hatnote navigation-not-searchable">Main articles: <a href="Bernoulli_scheme" title="Bernoulli scheme">Bernoulli scheme</a> and <a href="Dyadic_transformation" title="Dyadic transformation">Dyadic transformation</a></div>
<p>One way to create a dynamical system out of the Bernoulli process is as a <a href="Shift_space" title="Shift space">shift space</a>. There is a natural translation symmetry on the product space <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \Omega =2^{\mathbb {N} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \Omega =2^{\mathbb {N} }}</annotation>
</semantics>
</math></span><img src="./efb6018f046c4eef7e0ec678fbafb73944d1d306.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.358ex; height:2.676ex;" alt="{\displaystyle \Omega =2^{\mathbb {N} }}" loading="lazy"></span> given by the <a href="Shift_operator" title="Shift operator">shift operator</a>
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T(X_{0},X_{1},X_{2},\cdots )=(X_{1},X_{2},\cdots )}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
<mo stretchy="false">(</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>0</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mo stretchy="false">(</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T(X_{0},X_{1},X_{2},\cdots )=(X_{1},X_{2},\cdots )}</annotation>
</semantics>
</math></span><img src="./526211900ef98bde7f9c4f63b2e4c34b9064aa5d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:33.862ex; height:2.843ex;" alt="{\displaystyle T(X_{0},X_{1},X_{2},\cdots )=(X_{1},X_{2},\cdots )}" loading="lazy"></span></dd></dl>
<p>The Bernoulli measure, defined above, is translation-invariant; that is, given any cylinder set <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \sigma \in {\mathcal {B}}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>σ<!-- σ --></mi>
<mo>∈<!-- ∈ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \sigma \in {\mathcal {B}}}</annotation>
</semantics>
</math></span><img src="./b307f5070e7e5a88323420ffd8797795b26b2862.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:5.714ex; height:2.176ex;" alt="{\displaystyle \sigma \in {\mathcal {B}}}" loading="lazy"></span>, one has
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P(T^{-1}(\sigma ))=P(\sigma )}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo stretchy="false">(</mo>
<msup>
<mi>T</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mn>1</mn>
</mrow>
</msup>
<mo stretchy="false">(</mo>
<mi>σ<!-- σ --></mi>
<mo stretchy="false">)</mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>P</mi>
<mo stretchy="false">(</mo>
<mi>σ<!-- σ --></mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P(T^{-1}(\sigma ))=P(\sigma )}</annotation>
</semantics>
</math></span><img src="./160ef2056dd6fbcc3d6a865c6e8c16e151d3f35d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:18.729ex; height:3.176ex;" alt="{\displaystyle P(T^{-1}(\sigma ))=P(\sigma )}" loading="lazy"></span></dd></dl>
<p>and thus the <a href="Bernoulli_measure" class="mw-redirect" title="Bernoulli measure">Bernoulli measure</a> is a <a href="Haar_measure" title="Haar measure">Haar measure</a>; it is an <a href="Invariant_measure" title="Invariant measure">invariant measure</a> on the product space.
</p><p>Instead of the probability measure <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P:{\mathcal {B}}\to \mathbb {R} }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>P</mi>
<mo>:</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">→<!-- → --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">R</mi>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle P:{\mathcal {B}}\to \mathbb {R} }</annotation>
</semantics>
</math></span><img src="./3c67fef882baaca577efe12117456831ac8bdc14.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:10.518ex; height:2.176ex;" alt="{\displaystyle P:{\mathcal {B}}\to \mathbb {R} }" loading="lazy"></span>, consider instead some arbitrary function <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>f</mi>
<mo>:</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">→<!-- → --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">R</mi>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }</annotation>
</semantics>
</math></span><img src="./f0f66ecb2ea14e77ccef83a7359ee5ced94627d2.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:10.051ex; height:2.509ex;" alt="{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }" loading="lazy"></span>. The <a href="Pushforward_measure" title="Pushforward measure">pushforward</a>
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f\circ T^{-1}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>f</mi>
<mo>∘<!-- ∘ --></mo>
<msup>
<mi>T</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mn>1</mn>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle f\circ T^{-1}}</annotation>
</semantics>
</math></span><img src="./e42190a4f44fe28646f243ba57858a1a707da076.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:7.526ex; height:3.009ex;" alt="{\displaystyle f\circ T^{-1}}" loading="lazy"></span></dd></dl>
<p>defined by <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \left(f\circ T^{-1}\right)(\sigma )=f(T^{-1}(\sigma ))}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow>
<mo>(</mo>
<mrow>
<mi>f</mi>
<mo>∘<!-- ∘ --></mo>
<msup>
<mi>T</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mn>1</mn>
</mrow>
</msup>
</mrow>
<mo>)</mo>
</mrow>
<mo stretchy="false">(</mo>
<mi>σ<!-- σ --></mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>f</mi>
<mo stretchy="false">(</mo>
<msup>
<mi>T</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mn>1</mn>
</mrow>
</msup>
<mo stretchy="false">(</mo>
<mi>σ<!-- σ --></mi>
<mo stretchy="false">)</mo>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \left(f\circ T^{-1}\right)(\sigma )=f(T^{-1}(\sigma ))}</annotation>
</semantics>
</math></span><img src="./f6dc8a498d82a4877768b87aa6c181f53c3bc25c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:26.56ex; height:3.343ex;" alt="{\displaystyle \left(f\circ T^{-1}\right)(\sigma )=f(T^{-1}(\sigma ))}" loading="lazy"></span> is again some function <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {B}}\to \mathbb {R} .}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">→<!-- → --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">R</mi>
</mrow>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {B}}\to \mathbb {R} .}</annotation>
</semantics>
</math></span><img src="./4f5afe0d3d098911c0985508126af5537e14efab.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.482ex; height:2.176ex;" alt="{\displaystyle {\mathcal {B}}\to \mathbb {R} .}" loading="lazy"></span> Thus, the map <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span> induces another map <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}}</annotation>
</semantics>
</math></span><img src="./22f23c1ed61880b309a6e6e18da2bd2609f1e0e5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.993ex; height:2.509ex;" alt="{\displaystyle {\mathcal {L}}_{T}}" loading="lazy"></span> on the space of all functions <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {B}}\to \mathbb {R} .}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">→<!-- → --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">R</mi>
</mrow>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {B}}\to \mathbb {R} .}</annotation>
</semantics>
</math></span><img src="./4f5afe0d3d098911c0985508126af5537e14efab.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.482ex; height:2.176ex;" alt="{\displaystyle {\mathcal {B}}\to \mathbb {R} .}" loading="lazy"></span> That is, given some <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>f</mi>
<mo>:</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">B</mi>
</mrow>
</mrow>
<mo stretchy="false">→<!-- → --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">R</mi>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }</annotation>
</semantics>
</math></span><img src="./f0f66ecb2ea14e77ccef83a7359ee5ced94627d2.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:10.051ex; height:2.509ex;" alt="{\displaystyle f:{\mathcal {B}}\to \mathbb {R} }" loading="lazy"></span>, one defines
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}f=f\circ T^{-1}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mi>f</mi>
<mo>=</mo>
<mi>f</mi>
<mo>∘<!-- ∘ --></mo>
<msup>
<mi>T</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mn>1</mn>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}f=f\circ T^{-1}}</annotation>
</semantics>
</math></span><img src="./eb468d498664869ce30c437a5ad27448d67831c6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:14.896ex; height:3.009ex;" alt="{\displaystyle {\mathcal {L}}_{T}f=f\circ T^{-1}}" loading="lazy"></span></dd></dl>
<p>The map <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}}</annotation>
</semantics>
</math></span><img src="./22f23c1ed61880b309a6e6e18da2bd2609f1e0e5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.993ex; height:2.509ex;" alt="{\displaystyle {\mathcal {L}}_{T}}" loading="lazy"></span> is a <a href="Linear_operator" class="mw-redirect" title="Linear operator">linear operator</a>, as (obviously) one has <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}(f+g)={\mathcal {L}}_{T}(f)+{\mathcal {L}}_{T}(g)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>f</mi>
<mo>+</mo>
<mi>g</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>f</mi>
<mo stretchy="false">)</mo>
<mo>+</mo>
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>g</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}(f+g)={\mathcal {L}}_{T}(f)+{\mathcal {L}}_{T}(g)}</annotation>
</semantics>
</math></span><img src="./f56d4542661cbf553ea0473bbff114c864202615.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:27.975ex; height:2.843ex;" alt="{\displaystyle {\mathcal {L}}_{T}(f+g)={\mathcal {L}}_{T}(f)+{\mathcal {L}}_{T}(g)}" loading="lazy"></span> and <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}(af)=a{\mathcal {L}}_{T}(f)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>a</mi>
<mi>f</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>a</mi>
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>f</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}(af)=a{\mathcal {L}}_{T}(f)}</annotation>
</semantics>
</math></span><img src="./99c2c592b64797ba33cd84c6643204e5e42aa934.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:17.72ex; height:2.843ex;" alt="{\displaystyle {\mathcal {L}}_{T}(af)=a{\mathcal {L}}_{T}(f)}" loading="lazy"></span> for functions <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f,g}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>f</mi>
<mo>,</mo>
<mi>g</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle f,g}</annotation>
</semantics>
</math></span><img src="./25b6ab1762925585cd7605809caa8b1b5284177b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:3.429ex; height:2.509ex;" alt="{\displaystyle f,g}" loading="lazy"></span> and constant <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle a}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>a</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle a}</annotation>
</semantics>
</math></span><img src="./ffd2487510aa438433a2579450ab2b3d557e5edc.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.23ex; height:1.676ex;" alt="{\displaystyle a}" loading="lazy"></span>. This linear operator is called the <a href="Transfer_operator" title="Transfer operator">transfer operator</a> or the <i>Ruelle–Frobenius–Perron operator</i>. This operator has a <a href="Spectrum" title="Spectrum">spectrum</a>, that is, a collection of <a href="Eigenfunction" title="Eigenfunction">eigenfunctions</a> and corresponding eigenvalues. The largest eigenvalue is the <a href="Frobenius%E2%80%93Perron_theorem" class="mw-redirect" title="Frobenius–Perron theorem">Frobenius–Perron eigenvalue</a>, and in this case, it is 1. The associated eigenvector is the invariant measure: in this case, it is the Bernoulli measure. That is, <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}(P)=P.}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>P</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mi>P</mi>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}(P)=P.}</annotation>
</semantics>
</math></span><img src="./1f4c9c2d202a683ab33f5db502a9e108b0cc9ffd.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:12.038ex; height:2.843ex;" alt="{\displaystyle {\mathcal {L}}_{T}(P)=P.}" loading="lazy"></span>
</p><p>If one restricts <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}}</annotation>
</semantics>
</math></span><img src="./22f23c1ed61880b309a6e6e18da2bd2609f1e0e5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.993ex; height:2.509ex;" alt="{\displaystyle {\mathcal {L}}_{T}}" loading="lazy"></span> to act on polynomials, then the eigenfunctions are (curiously) the <a href="Bernoulli_polynomial" class="mw-redirect" title="Bernoulli polynomial">Bernoulli polynomials</a>!<sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> This coincidence of naming was presumably not known to Bernoulli.
</p>
<div class="mw-heading mw-heading3"><h3 id="The_2x_mod_1_map">The 2x mod 1 map</h3></div>
<p>The above can be made more precise. Given an infinite string of binary digits <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle b_{0},b_{1},\cdots }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>0</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle b_{0},b_{1},\cdots }</annotation>
</semantics>
</math></span><img src="./797630c6cb410810117f56efe2e1aa380c493a8b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:8.895ex; height:2.509ex;" alt="{\displaystyle b_{0},b_{1},\cdots }" loading="lazy"></span> write
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{2^{n+1}}}.}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>y</mi>
<mo>=</mo>
<munderover>
<mo>∑<!-- ∑ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="normal">∞<!-- ∞ --></mi>
</mrow>
</munderover>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msup>
</mfrac>
</mrow>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{2^{n+1}}}.}</annotation>
</semantics>
</math></span><img src="./3bbc6b169aca376416e2d26797eaae4b005829a5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.005ex; width:13.96ex; height:6.843ex;" alt="{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{2^{n+1}}}.}" loading="lazy"></span></dd></dl>
<p>The resulting <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle y}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>y</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle y}</annotation>
</semantics>
</math></span><img src="./b8a6208ec717213d4317e666f1ae872e00620a0d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:1.155ex; height:2.009ex;" alt="{\displaystyle y}" loading="lazy"></span> is a real number in the unit interval <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 0\leq y\leq 1.}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>0</mn>
<mo>≤<!-- ≤ --></mo>
<mi>y</mi>
<mo>≤<!-- ≤ --></mo>
<mn>1.</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 0\leq y\leq 1.}</annotation>
</semantics>
</math></span><img src="./fc27dad49a1863e0821ef2f1d3d5c5b3faad929d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:10.324ex; height:2.509ex;" alt="{\displaystyle 0\leq y\leq 1.}" loading="lazy"></span> The shift <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span> induces a <a href="Homomorphism" title="Homomorphism">homomorphism</a>, also called <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span>, on the unit interval. Since <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T(b_{0},b_{1},b_{2},\cdots )=(b_{1},b_{2},\cdots ),}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
<mo stretchy="false">(</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>0</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mo stretchy="false">(</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>⋯<!-- ⋯ --></mo>
<mo stretchy="false">)</mo>
<mo>,</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T(b_{0},b_{1},b_{2},\cdots )=(b_{1},b_{2},\cdots ),}</annotation>
</semantics>
</math></span><img src="./eeed8d5eb0c742375fbb78995e1e339f92c6375c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:29.875ex; height:2.843ex;" alt="{\displaystyle T(b_{0},b_{1},b_{2},\cdots )=(b_{1},b_{2},\cdots ),}" loading="lazy"></span> one can see that <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T(y)=2y{\bmod {1}}.}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
<mo stretchy="false">(</mo>
<mi>y</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mn>2</mn>
<mi>y</mi>
<mrow class="MJX-TeXAtom-ORD">
<mo lspace="thickmathspace" rspace="thickmathspace">mod</mo>
<mrow class="MJX-TeXAtom-ORD">
<mn>1</mn>
</mrow>
</mrow>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T(y)=2y{\bmod {1}}.}</annotation>
</semantics>
</math></span><img src="./8af2e06699019fd499679d3b19a717324c401ce6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:17.508ex; height:2.843ex;" alt="{\displaystyle T(y)=2y{\bmod {1}}.}" loading="lazy"></span> This map is called the <a href="Dyadic_transformation" title="Dyadic transformation">dyadic transformation</a>; for the doubly-infinite sequence of bits <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \Omega =2^{\mathbb {Z} },}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi mathvariant="normal">Ω<!-- Ω --></mi>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
</mrow>
</msup>
<mo>,</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \Omega =2^{\mathbb {Z} },}</annotation>
</semantics>
</math></span><img src="./ea3de67fb24970c5026ac3269d5a62290184ed32.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:7.914ex; height:3.009ex;" alt="{\displaystyle \Omega =2^{\mathbb {Z} },}" loading="lazy"></span> the induced homomorphism is the <a href="Baker's_map" title="Baker's map">Baker's map</a>.
</p><p>Consider now the space of functions in <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle y}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>y</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle y}</annotation>
</semantics>
</math></span><img src="./b8a6208ec717213d4317e666f1ae872e00620a0d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:1.155ex; height:2.009ex;" alt="{\displaystyle y}" loading="lazy"></span>. Given some <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f(y)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>f</mi>
<mo stretchy="false">(</mo>
<mi>y</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle f(y)}</annotation>
</semantics>
</math></span><img src="./aaa9215c6afa4892692ba05ae4c44f23600ea79d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:4.243ex; height:2.843ex;" alt="{\displaystyle f(y)}" loading="lazy"></span> one can find that
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \left[{\mathcal {L}}_{T}f\right](y)={\frac {1}{2}}f\left({\frac {y}{2}}\right)+{\frac {1}{2}}f\left({\frac {y+1}{2}}\right)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow>
<mo>[</mo>
<mrow>
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<mi>f</mi>
</mrow>
<mo>]</mo>
</mrow>
<mo stretchy="false">(</mo>
<mi>y</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</mrow>
<mi>f</mi>
<mrow>
<mo>(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mi>y</mi>
<mn>2</mn>
</mfrac>
</mrow>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</mrow>
<mi>f</mi>
<mrow>
<mo>(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mrow>
<mi>y</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mn>2</mn>
</mfrac>
</mrow>
<mo>)</mo>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \left[{\mathcal {L}}_{T}f\right](y)={\frac {1}{2}}f\left({\frac {y}{2}}\right)+{\frac {1}{2}}f\left({\frac {y+1}{2}}\right)}</annotation>
</semantics>
</math></span><img src="./7a42c16c5a368f8dbba71bd90cc558454174923d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:36.374ex; height:6.176ex;" alt="{\displaystyle \left[{\mathcal {L}}_{T}f\right](y)={\frac {1}{2}}f\left({\frac {y}{2}}\right)+{\frac {1}{2}}f\left({\frac {y+1}{2}}\right)}" loading="lazy"></span></dd></dl>
<p>Restricting the action of the operator <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}}</annotation>
</semantics>
</math></span><img src="./22f23c1ed61880b309a6e6e18da2bd2609f1e0e5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.993ex; height:2.509ex;" alt="{\displaystyle {\mathcal {L}}_{T}}" loading="lazy"></span> to functions that are on polynomials, one finds that it has a <a href="Discrete_spectrum" class="mw-redirect" title="Discrete spectrum">discrete spectrum</a> given by
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\mathcal {L}}_{T}B_{n}=2^{-n}B_{n}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi class="MJX-tex-caligraphic" mathvariant="script">L</mi>
</mrow>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>T</mi>
</mrow>
</msub>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mi>n</mi>
</mrow>
</msup>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\mathcal {L}}_{T}B_{n}=2^{-n}B_{n}}</annotation>
</semantics>
</math></span><img src="./787ebda9e0e843e3d01531210618106c049152d7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:15.716ex; height:2.843ex;" alt="{\displaystyle {\mathcal {L}}_{T}B_{n}=2^{-n}B_{n}}" loading="lazy"></span></dd></dl>
<p>where the <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle B_{n}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle B_{n}}</annotation>
</semantics>
</math></span><img src="./2f568bf6d34e97b9fdda0dc7e276d6c4501d2045.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.982ex; height:2.509ex;" alt="{\displaystyle B_{n}}" loading="lazy"></span> are the <a href="Bernoulli_polynomials" title="Bernoulli polynomials">Bernoulli polynomials</a>. Indeed, the Bernoulli polynomials obey the identity
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\frac {1}{2}}B_{n}\left({\frac {y}{2}}\right)+{\frac {1}{2}}B_{n}\left({\frac {y+1}{2}}\right)=2^{-n}B_{n}(y)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</mrow>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mi>y</mi>
<mn>2</mn>
</mfrac>
</mrow>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</mrow>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<mrow>
<mi>y</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mn>2</mn>
</mfrac>
</mrow>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msup>
<mn>2</mn>
<mrow class="MJX-TeXAtom-ORD">
<mo>−<!-- − --></mo>
<mi>n</mi>
</mrow>
</msup>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>y</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\frac {1}{2}}B_{n}\left({\frac {y}{2}}\right)+{\frac {1}{2}}B_{n}\left({\frac {y+1}{2}}\right)=2^{-n}B_{n}(y)}</annotation>
</semantics>
</math></span><img src="./1f4131a3cb2eb5d1c621560d10a3165eec802fad.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:40.472ex; height:6.176ex;" alt="{\displaystyle {\frac {1}{2}}B_{n}\left({\frac {y}{2}}\right)+{\frac {1}{2}}B_{n}\left({\frac {y+1}{2}}\right)=2^{-n}B_{n}(y)}" loading="lazy"></span></dd></dl>
<div class="mw-heading mw-heading3"><h3 id="The_Cantor_set">The Cantor set</h3></div>
<p>Note that the sum
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{3^{n+1}}}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>y</mi>
<mo>=</mo>
<munderover>
<mo>∑<!-- ∑ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="normal">∞<!-- ∞ --></mi>
</mrow>
</munderover>
<mrow class="MJX-TeXAtom-ORD">
<mfrac>
<msub>
<mi>b</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<msup>
<mn>3</mn>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msup>
</mfrac>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{3^{n+1}}}}</annotation>
</semantics>
</math></span><img src="./3246653d5e7cad826bbdee053206edd9f34fd3bb.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.005ex; width:13.314ex; height:6.843ex;" alt="{\displaystyle y=\sum _{n=0}^{\infty }{\frac {b_{n}}{3^{n+1}}}}" loading="lazy"></span></dd></dl>
<p>gives the <a href="Cantor_function" title="Cantor function">Cantor function</a>, as conventionally defined. This is one reason why the set <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \{H,T\}^{\mathbb {N} }}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mo fence="false" stretchy="false">{</mo>
<mi>H</mi>
<mo>,</mo>
<mi>T</mi>
<msup>
<mo fence="false" stretchy="false">}</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \{H,T\}^{\mathbb {N} }}</annotation>
</semantics>
</math></span><img src="./79c296f18d575387a1ce15c6c0b7d930ceebdcff.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:8.478ex; height:3.176ex;" alt="{\displaystyle \{H,T\}^{\mathbb {N} }}" loading="lazy"></span> is sometimes called the <a href="Cantor_set" title="Cantor set">Cantor set</a>.
</p>
<div class="mw-heading mw-heading3"><h3 id="Odometer">Odometer</h3></div>
<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Markov_odometer" title="Markov odometer">Markov odometer</a></div>
<p>Another way to create a dynamical system is to define an <a href="Markov_odometer" title="Markov odometer">odometer</a>. Informally, this is exactly what it sounds like: just "add one" to the first position, and let the odometer "roll over" by using <a href="Carry_bit" class="mw-redirect" title="Carry bit">carry bits</a> as the odometer rolls over. This is nothing more than base-two addition on the set of infinite strings. Since addition forms a <a href="Group_(mathematics)" title="Group (mathematics)">group</a>, and the Bernoulli process was already given a topology, above, this provides a simple example of a <a href="Topological_group" title="Topological group">topological group</a>.
</p><p>In this case, the transformation <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span> is given by
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T\left(1,\dots ,1,0,X_{k+1},X_{k+2},\dots \right)=\left(0,\dots ,0,1,X_{k+1},X_{k+2},\dots \right).}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
<mrow>
<mo>(</mo>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mo>…<!-- … --></mo>
<mo>,</mo>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>…<!-- … --></mo>
</mrow>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<mrow>
<mn>0</mn>
<mo>,</mo>
<mo>…<!-- … --></mo>
<mo>,</mo>
<mn>0</mn>
<mo>,</mo>
<mn>1</mn>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>,</mo>
<mo>…<!-- … --></mo>
</mrow>
<mo>)</mo>
</mrow>
<mo>.</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T\left(1,\dots ,1,0,X_{k+1},X_{k+2},\dots \right)=\left(0,\dots ,0,1,X_{k+1},X_{k+2},\dots \right).}</annotation>
</semantics>
</math></span><img src="./6c5c5b4dc6ab6d5323081ee617e0f5adabdbe7a1.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:61.278ex; height:2.843ex;" alt="{\displaystyle T\left(1,\dots ,1,0,X_{k+1},X_{k+2},\dots \right)=\left(0,\dots ,0,1,X_{k+1},X_{k+2},\dots \right).}" loading="lazy"></span></dd></dl>
<p>It leaves the Bernoulli measure invariant only for the special case of <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle p=1/2}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>p</mi>
<mo>=</mo>
<mn>1</mn>
<mrow class="MJX-TeXAtom-ORD">
<mo>/</mo>
</mrow>
<mn>2</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle p=1/2}</annotation>
</semantics>
</math></span><img src="./c4a77b7a2e96414f0214f2d6ee49e462ccf33af0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; margin-left: -0.089ex; width:7.845ex; height:2.843ex;" alt="{\displaystyle p=1/2}" loading="lazy"></span> (the "fair coin"); otherwise not. Thus, <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle T}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>T</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle T}</annotation>
</semantics>
</math></span><img src="./ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.636ex; height:2.176ex;" alt="{\displaystyle T}" loading="lazy"></span> is a <a href="Measure_preserving_dynamical_system" class="mw-redirect" title="Measure preserving dynamical system">measure preserving dynamical system</a> in this case, otherwise, it is merely a <a href="Conservative_system" title="Conservative system">conservative system</a>.
</p>
<div class="mw-heading mw-heading2"><h2 id="Bernoulli_sequence">Bernoulli sequence</h2></div>
<p>The term <i>Bernoulli sequence</i> is often used informally to refer to a <a href="Realization_(probability)" title="Realization (probability)">realization</a> of a Bernoulli process.
However, the term has an entirely different formal definition as given below.
</p><p>Suppose a Bernoulli process formally defined as a single random variable (see preceding section). For every infinite sequence <i>x</i> of coin flips, there is a <a href="Sequence" title="Sequence">sequence</a> of integers
</p>
<dl><dd><span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {Z} ^{x}=\{n\in \mathbb {Z} :X_{n}(x)=1\}\,}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msup>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>x</mi>
</mrow>
</msup>
<mo>=</mo>
<mo fence="false" stretchy="false">{</mo>
<mi>n</mi>
<mo>∈<!-- ∈ --></mo>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
<mo>:</mo>
<msub>
<mi>X</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>n</mi>
</mrow>
</msub>
<mo stretchy="false">(</mo>
<mi>x</mi>
<mo stretchy="false">)</mo>
<mo>=</mo>
<mn>1</mn>
<mo fence="false" stretchy="false">}</mo>
<mspace width="thinmathspace"></mspace>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {Z} ^{x}=\{n\in \mathbb {Z} :X_{n}(x)=1\}\,}</annotation>
</semantics>
</math></span><img src="./4084051a80424a5152ed8ec8f624ed07d0f3d66a.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:26.799ex; height:2.843ex;" alt="{\displaystyle \mathbb {Z} ^{x}=\{n\in \mathbb {Z} :X_{n}(x)=1\}\,}" loading="lazy"></span></dd></dl>
<p>called the <i>Bernoulli sequence</i> associated with the Bernoulli process. For example, if <i>x</i> represents a sequence of coin flips, then the associated Bernoulli sequence is the list of natural numbers or time-points for which the coin toss outcome is <i>heads</i>.
</p><p>So defined, a Bernoulli sequence <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {Z} ^{x}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msup>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>x</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {Z} ^{x}}</annotation>
</semantics>
</math></span><img src="./faa672bb1aced1746a22b9c0ea90eb03e8d8cbab.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.723ex; height:2.343ex;" alt="{\displaystyle \mathbb {Z} ^{x}}" loading="lazy"></span> is also a random subset of the index set, the natural numbers <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {N} }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">N</mi>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {N} }</annotation>
</semantics>
</math></span><img src="./fdf9a96b565ea202d0f4322e9195613fb26a9bed.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.678ex; height:2.176ex;" alt="{\displaystyle \mathbb {N} }" loading="lazy"></span>.
</p><p><a href="Almost_all" title="Almost all">Almost all</a> Bernoulli sequences <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbb {Z} ^{x}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<msup>
<mrow class="MJX-TeXAtom-ORD">
<mi mathvariant="double-struck">Z</mi>
</mrow>
<mrow class="MJX-TeXAtom-ORD">
<mi>x</mi>
</mrow>
</msup>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \mathbb {Z} ^{x}}</annotation>
</semantics>
</math></span><img src="./faa672bb1aced1746a22b9c0ea90eb03e8d8cbab.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.723ex; height:2.343ex;" alt="{\displaystyle \mathbb {Z} ^{x}}" loading="lazy"></span> are <a href="Ergodic_sequence" title="Ergodic sequence">ergodic sequences</a>.
</p>
<div class="mw-heading mw-heading2"><h2 id="Randomness_extraction">Randomness extraction</h2></div>
<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Randomness_extractor" title="Randomness extractor">Randomness extractor</a></div>
<p>From any Bernoulli process one may derive a Bernoulli process with <i>p</i> = 1/2 by the <a href="Von_Neumann_extractor" class="mw-redirect" title="Von Neumann extractor">von Neumann extractor</a>, the earliest <a href="Randomness_extractor" title="Randomness extractor">randomness extractor</a>, which actually extracts uniform randomness.
</p>
<div class="mw-heading mw-heading3"><h3 id="Basic_von_Neumann_extractor">Basic von Neumann extractor</h3></div>
<p>Represent the observed process as a sequence of zeroes and ones, or bits, and group that input stream in non-overlapping pairs of successive bits, such as (11)(00)(10)... . Then for each pair,
</p>
<ul><li>if the bits are equal, discard;</li>
<li>if the bits are not equal, output the first bit.</li></ul>
<p>This table summarizes the computation.
</p>
<table>
<tbody><tr>
<th>input</th>
<th>output
</th></tr>
<tr>
<td>00</td>
<td>discard
</td></tr>
<tr>
<td>01</td>
<td>0
</td></tr>
<tr>
<td>10</td>
<td>1
</td></tr>
<tr>
<td>11</td>
<td>discard
</td></tr></tbody></table>
<p>For example, an input stream of eight bits <i>10011011</i> would by grouped into pairs as <i>(10)(01)(10)(11)</i>. Then, according to the table above, these pairs are translated into the output of the procedure:
<i>(1)(0)(1)()</i> (=<i>101</i>).
</p><p>In the output stream 0 and 1 are equally likely, as 10 and 01 are equally likely in the original, both having probability <i>p</i>(1−<i>p</i>) = (1−<i>p</i>)<i>p</i>. This extraction of uniform randomness does not require the input trials to be independent, only <a href="Uncorrelated" class="mw-redirect" title="Uncorrelated">uncorrelated</a>. More generally, it works for any <a href="Exchangeable_random_variables" title="Exchangeable random variables">exchangeable sequence</a> of bits: all sequences that are finite rearrangements are equally likely.
</p><p>The von Neumann extractor uses two input bits to produce either zero or one output bits, so the output is shorter than the input by a factor of at least 2. On average the computation discards proportion <i>p</i><sup>2</sup> + (1 − <i>p</i>)<sup>2</sup> of the input pairs(00 and 11), which is near one when <i>p</i> is near zero or one, and is minimized at 1/4 when <i>p</i> = 1/2 for the original process (in which case the output stream is 1/4 the length of the input stream on average).
</p><p>Von Neumann (classical) main operation <a href="Pseudocode" title="Pseudocode">pseudocode</a>:
</p>
<div class="mw-highlight mw-highlight-lang-text mw-content-ltr" dir="ltr"><pre>if (Bit1 ≠ Bit2) {
output(Bit1)
}
</pre></div>
<div class="mw-heading mw-heading3"><h3 id="Iterated_von_Neumann_extractor">Iterated von Neumann extractor</h3></div>
<p>This decrease in efficiency, or waste of randomness present in the input stream, can be mitigated by iterating the algorithm over the input data. This way the output can be made to be "arbitrarily close to the entropy bound".<sup id="cite_ref-Peres_5-0" class="reference"><a href="#cite_note-Peres-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup>
</p><p>The iterated version of the von Neumann algorithm, also known as advanced multi-level strategy (AMLS),<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> was introduced by Yuval Peres in 1992.<sup id="cite_ref-Peres_5-1" class="reference"><a href="#cite_note-Peres-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> It works recursively, recycling "wasted randomness" from two sources: the sequence of discard-non-discard, and the values of discarded pairs (0 for 00, and 1 for 11). It relies on the fact that, given the sequence already generated, both of those sources are still exchangeable sequences of bits, and thus eligible for another round of extraction. While such generation of additional sequences can be iterated infinitely to extract all available entropy, an infinite amount of computational resources is required, therefore the number of iterations is typically fixed to a low value – this value either fixed in advance, or calculated at runtime.
</p><p>More concretely, on an input sequence, the algorithm consumes the input bits in pairs, generating output together with two new sequences, () gives AMLS paper notation:
</p>
<table>
<tbody><tr>
<th>input</th>
<th>output</th>
<th>new sequence 1(A)</th>
<th>new sequence 2(1)
</th></tr>
<tr>
<td>00</td>
<td><i>none</i></td>
<td>0</td>
<td>0
</td></tr>
<tr>
<td>01</td>
<td>0</td>
<td>1</td>
<td><i>none</i>
</td></tr>
<tr>
<td>10</td>
<td>1</td>
<td>1</td>
<td><i>none</i>
</td></tr>
<tr>
<td>11</td>
<td><i>none</i></td>
<td>0</td>
<td>1
</td></tr></tbody></table>
<p>(If the length of the input is odd, the last bit is completely discarded.) Then the algorithm is applied recursively to each of the two new sequences, until the input is empty.
</p><p>Example: The input stream from the AMLS paper, <i>11001011101110</i> using 1 for H and 0 for T, is processed this way:
</p>
<table>
<tbody><tr>
<th>step number</th>
<th>input</th>
<th>output</th>
<th>new sequence 1(A)</th>
<th>new sequence 2(1)
</th></tr>
<tr>
<td>0</td>
<td>(11)(00)(10)(11)(10)(11)(10)</td>
<td>()()(1)()(1)()(1)</td>
<td>(1)(1)(0)(1)(0)(1)(0)</td>
<td>(1)(0)()(1)()(1)()
</td></tr>
<tr>
<td>1</td>
<td>(10)(11)(11)(01)(01)()</td>
<td>(1)()()(0)(0)</td>
<td>(0)(1)(1)(0)(0)</td>
<td>()(1)(1)()()
</td></tr>
<tr>
<td>2</td>
<td>(11)(01)(10)()</td>
<td>()(0)(1)</td>
<td>(0)(1)(1)</td>
<td>(1)()()
</td></tr>
<tr>
<td>3</td>
<td>(10)(11)</td>
<td>(1)</td>
<td>(1)(0)</td>
<td>()(1)
</td></tr>
<tr>
<td>4</td>
<td>(11)()</td>
<td>()</td>
<td>(0)</td>
<td>(1)
</td></tr>
<tr>
<td>5</td>
<td>(10)</td>
<td>(1)</td>
<td>(1)</td>
<td>()
</td></tr>
<tr>
<td>6</td>
<td>()</td>
<td>()</td>
<td>()</td>
<td>()
</td></tr></tbody></table>
<p><br>
</p><p>Starting from step 1, the input is a concatenation of sequence 2 and sequence 1 from the previous step (the order is arbitrary but should be fixed). The final output is <i>()()(1)()(1)()(1)(1)()()(0)(0)()(0)(1)(1)()(1)</i> (=<i>1111000111</i>), so from 14 bits of input 10 bits of output were generated, as opposed to 3 bits through the von Neumann algorithm alone. The constant output of exactly 2 bits per round per bit pair (compared with a variable none to 1 bit in classical VN) also allows for constant-time implementations which are resistant to <a href="Timing_attack" title="Timing attack">timing attacks</a>.
</p><p>Von Neumann–Peres (iterated) main operation pseudocode:
</p>
<div class="mw-highlight mw-highlight-lang-text mw-content-ltr" dir="ltr"><pre>if (Bit1 ≠ Bit2) {
output(1, Sequence1)
output(Bit1)
} else {
output(0, Sequence1)
output(Bit1, Sequence2)
}
</pre></div>
<p>Another tweak was presented in 2016, based on the observation that the Sequence2 channel doesn't provide much throughput, and a hardware implementation with a finite number of levels can benefit from discarding it earlier in exchange for processing more levels of Sequence1.<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup>
</p>
<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>
<style data-mw-deduplicate="TemplateStyles:r1239543626">
/* start https://en.wikipedia.org/ */
.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}
/* end https://en.wikipedia.org/ */
</style><div class="reflist">
<div class="mw-references-wrap"><ol class="references">
<li id="cite_note-:0-1"><span class="mw-cite-backlink">^ <a href="#cite_ref-:0_1-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-:0_1-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><style data-mw-deduplicate="TemplateStyles:r1238218222">
/* start https://en.wikipedia.org/ */
.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}
/* end https://en.wikipedia.org/ */
</style><cite id="CITEREFDekkingKraaikampLopuhaäMeester2005" class="citation book cs1">Dekking, F. M.; Kraaikamp, C.; Lopuhaä, H. P.; Meester, L. E. (2005). <i>A modern introduction to probability and statistics</i>. Springer. pp. <span class="nowrap">45–</span>46. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>9781852338961</bdi>.</cite></span>
</li>
<li id="cite_note-klenke-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-klenke_2-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFKlenke2006" class="citation book cs1">Klenke, Achim (2006). <i>Probability Theory</i>. Springer-Verlag. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-84800-047-6</bdi>.</cite></span>
</li>
<li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text">Pierre Gaspard, "<i>r</i>-adic one-dimensional maps and the Euler summation formula", <i>Journal of Physics A</i>, <b>25</b> (letter) L483-L485 (1992).</span>
</li>
<li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text">Dean J. Driebe, Fully Chaotic Maps and Broken Time Symmetry, (1999) Kluwer Academic Publishers, Dordrecht Netherlands <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>0-7923-5564-4</bdi></span>
</li>
<li id="cite_note-Peres-5"><span class="mw-cite-backlink">^ <a href="#cite_ref-Peres_5-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Peres_5-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><cite id="CITEREFPeres1992" class="citation journal cs1">Peres, Yuval (March 1992). <a rel="nofollow" class="external text" href="https://doi.org/10.1214%2Faos%2F1176348543">"Iterating Von Neumann's Procedure for Extracting Random Bits"</a>. <i>The Annals of Statistics</i>. <b>20</b> (1): <span class="nowrap">590–</span>597. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1214%2Faos%2F1176348543">10.1214/aos/1176348543</a></span>.</cite></span>
</li>
<li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.eecs.harvard.edu/~michaelm/coinflipext.pdf">"Tossing a Biased Coin"</a> <span class="cs1-format">(PDF)</span>. eecs.harvard.edu. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100331021838/http://www.eecs.harvard.edu/~michaelm/coinflipext.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on 2010-03-31<span class="reference-accessdate">. Retrieved <span class="nowrap">2018-07-28</span></span>.</cite></span>
</li>
<li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text"><cite id="CITEREFRožićYangDehaeneVerbauwhede2016" class="citation conference cs1">Rožić, Vladimir; Yang, Bohan; Dehaene, Wim; Verbauwhede, Ingrid (3–5 May 2016). <a rel="nofollow" class="external text" href="https://www.esat.kuleuven.be/cosic/publications/article-2628.pdf"><i>Iterating Von Neumann's post-processing under hardware constraints</i></a> <span class="cs1-format">(PDF)</span>. 2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST). Maclean, VA, USA. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FHST.2016.7495553">10.1109/HST.2016.7495553</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190212011337/https://www.esat.kuleuven.be/cosic/publications/article-2628.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on 2019-02-12.</cite></span>
</li>
</ol></div></div>
<div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2></div>
<ul><li>Carl W. Helstrom, <i>Probability and Stochastic Processes for Engineers</i>, (1984) Macmillan Publishing Company, New York <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>0-02-353560-1</bdi>.</li></ul>
<div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2></div>
<ul><li><a rel="nofollow" class="external text" href="http://www.r-statistics.com/2011/11/diagram-for-a-bernoulli-process-using-r/">Using a binary tree diagram for describing a Bernoulli process</a></li></ul>
<div class="navbox-styles"><style data-mw-deduplicate="TemplateStyles:r1236075235">
/* start https://en.wikipedia.org/ */
.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}
/* end https://en.wikipedia.org/ */
</style></div><div role="navigation" class="navbox" aria-labelledby="Stochastic_processes496" style="padding:3px"><table class="nowraplinks mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Stochastic_processes496" style="font-size:114%;margin:0 4em"><a href="Stochastic_process" title="Stochastic process">Stochastic processes</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Discrete-time_stochastic_process" class="mw-redirect" title="Discrete-time stochastic process">Discrete time</a></th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul>
<li><a href="Branching_process" title="Branching process">Branching process</a></li>
<li><a href="Chinese_restaurant_process" title="Chinese restaurant process">Chinese restaurant process</a></li>
<li><a href="Galton%E2%80%93Watson_process" title="Galton–Watson process">Galton–Watson process</a></li>
<li><a href="Independent_and_identically_distributed_random_variables" title="Independent and identically distributed random variables">Independent and identically distributed random variables</a></li>
<li><a href="Markov_chain" title="Markov chain">Markov chain</a></li>
<li><a href="Moran_process" title="Moran process">Moran process</a></li>
<li><a href="Random_walk" title="Random walk">Random walk</a>
<ul><li><a href="Loop-erased_random_walk" title="Loop-erased random walk">Loop-erased</a></li>
<li><a href="Self-avoiding_walk" title="Self-avoiding walk">Self-avoiding</a></li>
<li><a href="Biased_random_walk_on_a_graph" title="Biased random walk on a graph"> Biased</a></li>
<li><a href="Maximal_entropy_random_walk" title="Maximal entropy random walk">Maximal entropy</a></li></ul></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Continuous-time_stochastic_process" title="Continuous-time stochastic process">Continuous time</a></th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Additive_process" title="Additive process">Additive process</a></li>
<li><a href="Airy_process" title="Airy process">Airy process</a></li>
<li><a href="Bessel_process" title="Bessel process">Bessel process</a></li>
<li><a href="Birth%E2%80%93death_process" title="Birth–death process">Birth–death process</a>
<ul><li><a href="Birth_process" title="Birth process">pure birth</a></li></ul></li>
<li><a href="Wiener_process" title="Wiener process">Brownian motion</a>
<ul><li><a href="Brownian_bridge" title="Brownian bridge">Bridge</a></li>
<li><a href="Dyson_Brownian_motion" title="Dyson Brownian motion">Dyson</a></li>
<li><a href="Brownian_excursion" title="Brownian excursion">Excursion</a></li>
<li><a href="Fractional_Brownian_motion" title="Fractional Brownian motion">Fractional</a></li>
<li><a href="Geometric_Brownian_motion" title="Geometric Brownian motion">Geometric</a></li>
<li><a href="Brownian_meander" title="Brownian meander">Meander</a></li></ul></li>
<li><a href="Cauchy_process" title="Cauchy process">Cauchy process</a></li>
<li><a href="Contact_process_(mathematics)" title="Contact process (mathematics)">Contact process</a></li>
<li><a href="Continuous-time_random_walk" title="Continuous-time random walk">Continuous-time random walk</a></li>
<li><a href="Cox_process" title="Cox process">Cox process</a></li>
<li><a href="Diffusion_process" title="Diffusion process">Diffusion process</a></li>
<li><a href="Empirical_process" title="Empirical process">Empirical process</a></li>
<li><a href="Feller_process" title="Feller process">Feller process</a></li>
<li><a href="Fleming%E2%80%93Viot_process" title="Fleming–Viot process">Fleming–Viot process</a></li>
<li><a href="Gamma_process" title="Gamma process">Gamma process</a></li>
<li><a href="Geometric_process" title="Geometric process">Geometric process</a></li>
<li><a href="Hawkes_process" title="Hawkes process">Hawkes process</a></li>
<li><a href="Hunt_process" title="Hunt process">Hunt process</a></li>
<li><a href="Interacting_particle_system" title="Interacting particle system">Interacting particle systems</a></li>
<li><a href="It%C3%B4_diffusion" title="Itô diffusion">Itô diffusion</a></li>
<li><a href="It%C3%B4_process" class="mw-redirect" title="Itô process">Itô process</a></li>
<li><a href="Jump_diffusion" title="Jump diffusion">Jump diffusion</a></li>
<li><a href="Jump_process" title="Jump process">Jump process</a></li>
<li><a href="L%C3%A9vy_process" title="Lévy process">Lévy process</a></li>
<li><a href="Local_time_(mathematics)" title="Local time (mathematics)">Local time</a></li>
<li><a href="Markov_additive_process" title="Markov additive process">Markov additive process</a></li>
<li><a href="McKean%E2%80%93Vlasov_process" title="McKean–Vlasov process">McKean–Vlasov process</a></li>
<li><a href="Ornstein%E2%80%93Uhlenbeck_process" title="Ornstein–Uhlenbeck process">Ornstein–Uhlenbeck process</a></li>
<li><a href="Poisson_point_process" title="Poisson point process">Poisson process</a>
<ul><li><a href="Compound_Poisson_process" title="Compound Poisson process">Compound</a></li>
<li><a href="Non-homogeneous_Poisson_process" class="mw-redirect" title="Non-homogeneous Poisson process">Non-homogeneous</a></li></ul></li>
<li><a href="Quasimartingale" title="Quasimartingale">Quasimartingale</a></li>
<li><a href="Schramm%E2%80%93Loewner_evolution" title="Schramm–Loewner evolution">Schramm–Loewner evolution</a></li>
<li><a href="Semimartingale" title="Semimartingale">Semimartingale</a></li>
<li><a href="Sigma-martingale" title="Sigma-martingale">Sigma-martingale</a></li>
<li><a href="Stable_process" title="Stable process">Stable process</a></li>
<li><a href="Superprocess" title="Superprocess">Superprocess</a></li>
<li><a href="Telegraph_process" title="Telegraph process">Telegraph process</a></li>
<li><a href="Variance_gamma_process" title="Variance gamma process">Variance gamma process</a></li>
<li><a href="Wiener_process" title="Wiener process">Wiener process</a></li>
<li><a href="Wiener_sausage" title="Wiener sausage">Wiener sausage</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Both</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Branching_process" title="Branching process">Branching process</a></li>
<li><a href="Gaussian_process" title="Gaussian process">Gaussian process</a></li>
<li><a href="Hidden_Markov_model" title="Hidden Markov model">Hidden Markov model (HMM)</a></li>
<li><a href="Markov_process" class="mw-redirect" title="Markov process">Markov process</a></li>
<li><a href="Martingale_(probability_theory)" title="Martingale (probability theory)">Martingale</a>
<ul><li><a href="Martingale_difference_sequence" title="Martingale difference sequence">Differences</a></li>
<li><a href="Local_martingale" title="Local martingale">Local</a></li>
<li><a href="Submartingale" class="mw-redirect" title="Submartingale">Sub-</a></li>
<li><a href="Supermartingale" class="mw-redirect" title="Supermartingale">Super-</a></li></ul></li>
<li><a href="Random_dynamical_system" title="Random dynamical system">Random dynamical system</a></li>
<li><a href="Regenerative_process" title="Regenerative process">Regenerative process</a></li>
<li><a href="Renewal_process" class="mw-redirect" title="Renewal process">Renewal process</a></li>
<li><a href="Stochastic_chains_with_memory_of_variable_length" title="Stochastic chains with memory of variable length">Stochastic chains with memory of variable length</a></li>
<li><a href="White_noise" title="White noise">White noise</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Fields and other</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Dirichlet_process" title="Dirichlet process">Dirichlet process</a></li>
<li><a href="Gaussian_random_field" title="Gaussian random field">Gaussian random field</a></li>
<li><a href="Gibbs_measure" title="Gibbs measure">Gibbs measure</a></li>
<li><a href="Hopfield_model" class="mw-redirect" title="Hopfield model">Hopfield model</a></li>
<li><a href="Ising_model" title="Ising model">Ising model</a>
<ul><li><a href="Potts_model" title="Potts model">Potts model</a></li>
<li><a href="Boolean_network" title="Boolean network">Boolean network</a></li></ul></li>
<li><a href="Markov_random_field" title="Markov random field">Markov random field</a></li>
<li><a href="Percolation_theory" title="Percolation theory">Percolation</a></li>
<li><a href="Pitman%E2%80%93Yor_process" title="Pitman–Yor process">Pitman–Yor process</a></li>
<li><a href="Point_process" title="Point process">Point process</a>
<ul><li><a href="Point_process#Cox_point_process" title="Point process">Cox</a></li>
<li><a href="Determinantal_point_process" title="Determinantal point process">Determinantal</a></li>
<li><a href="Poisson_point_process" title="Poisson point process">Poisson</a></li></ul></li>
<li><a href="Random_field" title="Random field">Random field</a></li>
<li><a href="Random_graph" title="Random graph">Random graph</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Time_series" title="Time series">Time series models</a></th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Autoregressive_conditional_heteroskedasticity" title="Autoregressive conditional heteroskedasticity">Autoregressive conditional heteroskedasticity (ARCH) model</a></li>
<li><a href="Autoregressive_integrated_moving_average" title="Autoregressive integrated moving average">Autoregressive integrated moving average (ARIMA) model</a></li>
<li><a href="Autoregressive_model" title="Autoregressive model">Autoregressive (AR) model</a></li>
<li><a href="Autoregressive%E2%80%93moving-average_model" class="mw-redirect" title="Autoregressive–moving-average model">Autoregressive–moving-average (ARMA) model</a></li>
<li><a href="Autoregressive_conditional_heteroskedasticity" title="Autoregressive conditional heteroskedasticity">Generalized autoregressive conditional heteroskedasticity (GARCH) model</a></li>
<li><a href="Moving-average_model" title="Moving-average model">Moving-average (MA) model</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Asset_pricing_model" class="mw-redirect" title="Asset pricing model">Financial models</a></th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Binomial_options_pricing_model" title="Binomial options pricing model">Binomial options pricing model</a></li>
<li><a href="Black%E2%80%93Derman%E2%80%93Toy_model" title="Black–Derman–Toy model">Black–Derman–Toy</a></li>
<li><a href="Black%E2%80%93Karasinski_model" title="Black–Karasinski model">Black–Karasinski</a></li>
<li><a href="Black%E2%80%93Scholes_model" title="Black–Scholes model">Black–Scholes</a></li>
<li><a href="Chan%E2%80%93Karolyi%E2%80%93Longstaff%E2%80%93Sanders_process" title="Chan–Karolyi–Longstaff–Sanders process">Chan–Karolyi–Longstaff–Sanders (CKLS)</a></li>
<li><a href="Chen_model" title="Chen model">Chen</a></li>
<li><a href="Constant_elasticity_of_variance_model" title="Constant elasticity of variance model">Constant elasticity of variance (CEV)</a></li>
<li><a href="Cox%E2%80%93Ingersoll%E2%80%93Ross_model" title="Cox–Ingersoll–Ross model">Cox–Ingersoll–Ross (CIR)</a></li>
<li><a href="Garman%E2%80%93Kohlhagen_model" class="mw-redirect" title="Garman–Kohlhagen model">Garman–Kohlhagen</a></li>
<li><a href="Heath%E2%80%93Jarrow%E2%80%93Morton_framework" title="Heath–Jarrow–Morton framework">Heath–Jarrow–Morton (HJM)</a></li>
<li><a href="Heston_model" title="Heston model">Heston</a></li>
<li><a href="Ho%E2%80%93Lee_model" title="Ho–Lee model">Ho–Lee</a></li>
<li><a href="Hull%E2%80%93White_model" title="Hull–White model">Hull–White</a></li>
<li><a href="Korn%E2%80%93Kreer%E2%80%93Lenssen_model" title="Korn–Kreer–Lenssen model">Korn-Kreer-Lenssen</a></li>
<li><a href="LIBOR_market_model" title="LIBOR market model">LIBOR market</a></li>
<li><a href="Rendleman%E2%80%93Bartter_model" title="Rendleman–Bartter model">Rendleman–Bartter</a></li>
<li><a href="SABR_volatility_model" title="SABR volatility model">SABR volatility</a></li>
<li><a href="Vasicek_model" title="Vasicek model">Vašíček</a></li>
<li><a href="Wilkie_investment_model" title="Wilkie investment model">Wilkie</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Actuarial_mathematics" class="mw-redirect" title="Actuarial mathematics">Actuarial models</a></th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="B%C3%BChlmann_model" title="Bühlmann model">Bühlmann</a></li>
<li><a href="Cram%C3%A9r%E2%80%93Lundberg_model" class="mw-redirect" title="Cramér–Lundberg model">Cramér–Lundberg</a></li>
<li><a href="Risk_process" class="mw-redirect" title="Risk process">Risk process</a></li>
<li><a href="Sparre%E2%80%93Anderson_model" class="mw-redirect" title="Sparre–Anderson model">Sparre–Anderson</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Queueing_model" class="mw-redirect" title="Queueing model">Queueing models</a></th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Bulk_queue" title="Bulk queue">Bulk</a></li>
<li><a href="Fluid_queue" title="Fluid queue">Fluid</a></li>
<li><a href="G-network" title="G-network">Generalized queueing network</a></li>
<li><a href="M/G/1_queue" title="M/G/1 queue">M/G/1</a></li>
<li><a href="M/M/1_queue" title="M/M/1 queue">M/M/1</a></li>
<li><a href="M/M/c_queue" title="M/M/c queue">M/M/c</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Properties</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="C%C3%A0dl%C3%A0g" title="Càdlàg">Càdlàg paths</a></li>
<li><a href="Continuous_stochastic_process" title="Continuous stochastic process">Continuous</a></li>
<li><a href="Sample-continuous_process" title="Sample-continuous process">Continuous paths</a></li>
<li><a href="Ergodicity" title="Ergodicity">Ergodic</a></li>
<li><a href="Exchangeable_random_variables" title="Exchangeable random variables">Exchangeable</a></li>
<li><a href="Feller-continuous_process" title="Feller-continuous process">Feller-continuous</a></li>
<li><a href="Gauss%E2%80%93Markov_process" title="Gauss–Markov process">Gauss–Markov</a></li>
<li><a href="Markov_property" title="Markov property">Markov</a></li>
<li><a href="Mixing_(mathematics)" title="Mixing (mathematics)">Mixing</a></li>
<li><a href="Piecewise-deterministic_Markov_process" title="Piecewise-deterministic Markov process">Piecewise-deterministic</a></li>
<li><a href="Predictable_process" title="Predictable process">Predictable</a></li>
<li><a href="Progressively_measurable_process" title="Progressively measurable process">Progressively measurable</a></li>
<li><a href="Self-similar_process" title="Self-similar process">Self-similar</a></li>
<li><a href="Stationary_process" title="Stationary process">Stationary</a></li>
<li><a href="Time_reversibility" title="Time reversibility">Time-reversible</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Limit theorems</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Central_limit_theorem" title="Central limit theorem">Central limit theorem</a></li>
<li><a href="Donsker's_theorem" title="Donsker's theorem">Donsker's theorem</a></li>
<li><a href="Doob's_martingale_convergence_theorems" title="Doob's martingale convergence theorems">Doob's martingale convergence theorems</a></li>
<li><a href="Ergodic_theorem" class="mw-redirect" title="Ergodic theorem">Ergodic theorem</a></li>
<li><a href="Fisher%E2%80%93Tippett%E2%80%93Gnedenko_theorem" title="Fisher–Tippett–Gnedenko theorem">Fisher–Tippett–Gnedenko theorem</a></li>
<li><a href="Large_deviation_principle" class="mw-redirect" title="Large deviation principle">Large deviation principle</a></li>
<li><a href="Law_of_large_numbers" title="Law of large numbers">Law of large numbers (weak/strong)</a></li>
<li><a href="Law_of_the_iterated_logarithm" title="Law of the iterated logarithm">Law of the iterated logarithm</a></li>
<li><a href="Maximal_ergodic_theorem" title="Maximal ergodic theorem">Maximal ergodic theorem</a></li>
<li><a href="Sanov's_theorem" title="Sanov's theorem">Sanov's theorem</a></li>
<li><a href="Zero%E2%80%93one_law" title="Zero–one law">Zero–one laws</a> (<a href="Blumenthal's_zero%E2%80%93one_law" title="Blumenthal's zero–one law">Blumenthal</a>, <a href="Borel%E2%80%93Cantelli_lemma" title="Borel–Cantelli lemma">Borel–Cantelli</a>, <a href="Engelbert%E2%80%93Schmidt_zero%E2%80%93one_law" title="Engelbert–Schmidt zero–one law">Engelbert–Schmidt</a>, <a href="Hewitt%E2%80%93Savage_zero%E2%80%93one_law" title="Hewitt–Savage zero–one law">Hewitt–Savage</a>, <a href="Kolmogorov's_zero%E2%80%93one_law" title="Kolmogorov's zero–one law"> Kolmogorov</a>, <a href="L%C3%A9vy's_zero%E2%80%93one_law" class="mw-redirect" title="Lévy's zero–one law">Lévy</a>)</li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="List_of_inequalities#Probability_theory_and_statistics" title="List of inequalities">Inequalities</a></th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Burkholder%E2%80%93Davis%E2%80%93Gundy_inequalities" class="mw-redirect" title="Burkholder–Davis–Gundy inequalities">Burkholder–Davis–Gundy</a></li>
<li><a href="Doob's_martingale_inequality" title="Doob's martingale inequality">Doob's martingale</a></li>
<li><a href="Doob's_upcrossing_inequality" class="mw-redirect" title="Doob's upcrossing inequality">Doob's upcrossing</a></li>
<li><a href="Kunita%E2%80%93Watanabe_inequality" title="Kunita–Watanabe inequality">Kunita–Watanabe</a></li>
<li><a href="Marcinkiewicz%E2%80%93Zygmund_inequality" title="Marcinkiewicz–Zygmund inequality">Marcinkiewicz–Zygmund</a></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Tools</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Cameron%E2%80%93Martin_formula" class="mw-redirect" title="Cameron–Martin formula">Cameron–Martin formula</a></li>
<li><a href="Convergence_of_random_variables" title="Convergence of random variables">Convergence of random variables</a></li>
<li><a href="Dol%C3%A9ans-Dade_exponential" title="Doléans-Dade exponential">Doléans-Dade exponential</a></li>
<li><a href="Doob_decomposition_theorem" title="Doob decomposition theorem">Doob decomposition theorem</a></li>
<li><a href="Doob%E2%80%93Meyer_decomposition_theorem" title="Doob–Meyer decomposition theorem">Doob–Meyer decomposition theorem</a></li>
<li><a href="Doob's_optional_stopping_theorem" class="mw-redirect" title="Doob's optional stopping theorem">Doob's optional stopping theorem</a></li>
<li><a href="Dynkin's_formula" title="Dynkin's formula">Dynkin's formula</a></li>
<li><a href="Feynman%E2%80%93Kac_formula" title="Feynman–Kac formula">Feynman–Kac formula</a></li>
<li><a href="Filtration_(probability_theory)" title="Filtration (probability theory)">Filtration</a></li>
<li><a href="Girsanov_theorem" title="Girsanov theorem">Girsanov theorem</a></li>
<li><a href="Infinitesimal_generator_(stochastic_processes)" title="Infinitesimal generator (stochastic processes)">Infinitesimal generator</a></li>
<li><a href="It%C3%B4_integral" class="mw-redirect" title="Itô integral">Itô integral</a></li>
<li><a href="It%C3%B4's_lemma" title="Itô's lemma">Itô's lemma</a></li>
<li><a href="Karhunen%E2%80%93Lo%C3%A8ve_theorem" class="mw-redirect" title="Karhunen–Loève theorem">Karhunen–Loève theorem</a></li>
<li><a href="Kolmogorov_continuity_theorem" title="Kolmogorov continuity theorem">Kolmogorov continuity theorem</a></li>
<li><a href="Kolmogorov_extension_theorem" title="Kolmogorov extension theorem">Kolmogorov extension theorem</a></li>
<li><a href="L%C3%A9vy%E2%80%93Prokhorov_metric" title="Lévy–Prokhorov metric">Lévy–Prokhorov metric</a></li>
<li><a href="Malliavin_calculus" title="Malliavin calculus">Malliavin calculus</a></li>
<li><a href="Martingale_representation_theorem" title="Martingale representation theorem">Martingale representation theorem</a></li>
<li><a href="Optional_stopping_theorem" title="Optional stopping theorem">Optional stopping theorem</a></li>
<li><a href="Prokhorov's_theorem" title="Prokhorov's theorem">Prokhorov's theorem</a></li>
<li><a href="Quadratic_variation" title="Quadratic variation">Quadratic variation</a></li>
<li><a href="Reflection_principle_(Wiener_process)" title="Reflection principle (Wiener process)">Reflection principle</a></li>
<li><a href="Skorokhod_integral" title="Skorokhod integral">Skorokhod integral</a></li>
<li><a href="Skorokhod's_representation_theorem" title="Skorokhod's representation theorem">Skorokhod's representation theorem</a></li>
<li><a href="Skorokhod_space" class="mw-redirect" title="Skorokhod space">Skorokhod space</a></li>
<li><a href="Snell_envelope" title="Snell envelope">Snell envelope</a></li>
<li><a href="Stochastic_differential_equation" title="Stochastic differential equation">Stochastic differential equation</a>
<ul><li><a href="Tanaka_equation" title="Tanaka equation">Tanaka</a></li></ul></li>
<li><a href="Stopping_time" title="Stopping time">Stopping time</a></li>
<li><a href="Stratonovich_integral" title="Stratonovich integral">Stratonovich integral</a></li>
<li><a href="Uniform_integrability" title="Uniform integrability">Uniform integrability</a></li>
<li><a href="Usual_hypotheses" class="mw-redirect" title="Usual hypotheses">Usual hypotheses</a></li>
<li><a href="Wiener_space" class="mw-redirect" title="Wiener space">Wiener space</a>
<ul><li><a href="Classical_Wiener_space" title="Classical Wiener space">Classical</a></li>
<li><a href="Abstract_Wiener_space" title="Abstract Wiener space">Abstract</a></li></ul></li></ul>
</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Disciplines</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">
<ul><li><a href="Actuarial_mathematics" class="mw-redirect" title="Actuarial mathematics">Actuarial mathematics</a></li>
<li><a href="Stochastic_control" title="Stochastic control">Control theory</a></li>
<li><a href="Econometrics" title="Econometrics">Econometrics</a></li>
<li><a href="Ergodic_theory" title="Ergodic theory">Ergodic theory</a></li>
<li><a href="Extreme_value_theory" title="Extreme value theory">Extreme value theory (EVT)</a></li>
<li><a href="Large_deviations_theory" title="Large deviations theory">Large deviations theory</a></li>
<li><a href="Mathematical_finance" title="Mathematical finance">Mathematical finance</a></li>
<li><a href="Mathematical_statistics" title="Mathematical statistics">Mathematical statistics</a></li>
<li><a href="Probability_theory" title="Probability theory">Probability theory</a></li>
<li><a href="Queueing_theory" title="Queueing theory">Queueing theory</a></li>
<li><a href="Renewal_theory" title="Renewal theory">Renewal theory</a></li>
<li><a href="Ruin_theory" title="Ruin theory">Ruin theory</a></li>
<li><a href="Signal_processing" title="Signal processing">Signal processing</a></li>
<li><a href="Statistics" title="Statistics">Statistics</a></li>
<li><a href="Stochastic_analysis" class="mw-redirect" title="Stochastic analysis">Stochastic analysis</a></li>
<li><a href="Time_series_analysis" class="mw-redirect" title="Time series analysis">Time series analysis</a></li>
<li><a href="Machine_learning" title="Machine learning">Machine learning</a></li></ul>
</div></td></tr><tr><td class="navbox-abovebelow hlist" colspan="2"><div>
<ul><li><a href="List_of_stochastic_processes_topics" title="List of stochastic processes topics">List of topics</a></li>
<li>Category</li></ul>
</div></td></tr></tbody></table></div></div><!--htdig_noindex--><div><div class="zim-footer">
This article is issued from <a class="external text" title="Last edited on 2025-06-20" href="https://en.wikipedia.org/wiki/?title=Bernoulli_process&oldid=1296539230">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.
</div>
</div><!--/htdig_noindex--></div>
</div>
</main>
</div>
</div>
</div>
</body></html>